Results 21 to 30 of about 167,661,519 (247)
Scheduling Jobs of Two Competing Agents on a Single Machine
IEEE Access, 2019 This paper studies a single-machine scheduling problem with a two competing agents in which the performance criteria of the first and second agents are to minimize the mean lateness and number of tardy jobs, respectively.
Chen-Yang Cheng +3 more
doaj +1 more source
KPI Science News, 2020 Background. In setting a problem of minimizing total tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descending order ...
Vadim V. Romanuke
doaj +1 more source
KPI Science News, 2020 Background. In setting a problem of minimizing total tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descending order ...
Vadim V. Romanuke
doaj +1 more source
Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
, 2003 We address the bicriteria problem of minimizing the number of tardy jobs and maximum earliness on a single machine where machine idle time is allowed. We show that the problem of minimizing the number of tardy jobs while maximum earliness is kept at its ...
Koksalan, SK +2 more
core +1 more source
KPI Science News, 2021 Background. In preemptive job scheduling, total weighted tardiness minimization is commonly reduced to solving a combinatorial problem, which becomes practically intractable as the number of jobs and the numbers of their processing periods increase.
Vadym V. Romanuke
doaj +1 more source
One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs
, 1998 In this study we consider the problem of sequencing n jobs on one machine under the dual objective of minimizing the maximum earliness (E-max) with minimum number of tardy jobs (n(T)).
Guner, E, Erol, SERPİL, Tani, K
core +1 more source
KPI Science News, 2020 Background. A schedule ensuring the exactly minimal total tardiness can be found with the respective integer linear programming problem. An open question is whether the exact schedule computation time changes if the job release dates are input to the ...
Vadim V. Romanuke
doaj +1 more source
Sustainable Operations and Computers, 2022 : In most organizations, especially order-oriented ones meeting deadlines are crucial. Job shop environments could be mentioned as an example where decision makers are try to schedule all jobs in such a way that tardy jobs (TJ) are minimized.
Milad Asadpour +4 more
doaj +1 more source
KPI Science News, 2021 Background. In preemptive job scheduling, which is a part of the flow-shop sequencing tasks, one of the most crucial goals is to obtain a schedule whose total tardiness would be minimal.
Vadim V. Romanuke
doaj +1 more source
Scheduling with bicriteria: total flowtime and number of tardy jobs
, 1997 In this paper the problem of minimizing total flowtime and number of tardy jobs on a single machine is considered. Some properties of the nondominated solutions are discussed.
Tuncay Bekiroglu +3 more
core +1 more source