Abstract
Two preemptive single-machine bicriteria scheduling problems with release dates and deadlines are considered in this paper. Each criterion is formulated as a maximum cost. In the first problem the cost of both criteria depends on the completion time of the tasks. This problem can be solved by enumerating all the Pareto optimal points with an approach proposed by Hoogeveen (1996) for the nonpreemptive problem without release dates. In the second problem, the costs of one criterion are dependent on the completion times of the tasks and the costs of the other criterion are dependent on the start times. This problem is more difficult but an efficient algorithm is proposed for a sub-problem with heads, tails, release dates and deadlines that appears in the job-shop scheduling problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K.R. Baker, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints, Operations Research 26 (1983) 111–120.
P. Brucker, Scheduling Algorithms (Springer, Berlin, 1998).
B. Faaland and T. Schmitt, Cost-based scheduling of workers and equipment in a fabrication and assembly shop, Operations Research 41 (1993) 253–268.
R.E. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling, Annals of Discrete Mathematics 4 (1979) 287–326.
J.A. Hoogeveen, Single-machine scheduling to minimize a function of two or three maximum cost criteria, Journal of Algorithms 21 (1996) 415–433.
J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report SPIKE-1989-2, Management Science Research Project, University of California, Los Angeles, CA (1955).
E.L. Lawler, Optimal sequencing of a single machine subject to precedence constraints, Management Science 19 (1973) 544–546.
F. Sourd and W. Nuijten, Multiple-machine lower bounds for shop scheduling problems, INFORMS Journal on Computing 12 (2000) 341–354.
F. Sourd and W. Nuijten, Scheduling with tails and deadlines, Journal of Scheduling 4 (2001) 105–121.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sourd, F. Preemptive Scheduling with Two Minimax Criteria. Annals of Operations Research 107, 303–319 (2001). https://doi.org/10.1023/A:1014971620268
Issue Date:
DOI: https://doi.org/10.1023/A:1014971620268