Abstract
This paper considers the problem of scheduling n jobs on a single machine to minimize the number of tardy (or late) jobs. Each job has a release date, a processing time and a due date. The general case with non-equal release dates and different due dates is considered. Using new and efficient lower bounds and several dominance rules, a branch and bound scheme is proposed based on the definition of a master sequence, i.e. a sequence containing at least one optimal sequence. With this procedure, 95% of 140-job instances are optimally solved in a maximum of one-hour CPU time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Baptiste, P., C. Le Pape, and L. P ´eridy, “Global constraints for partial CSPs:A case study of resource and due-date constraints, ”in 4th International Conference on Principles and Practices of Constraint Programming,Pisa, Italy, Lecture Notes In Computer Science 1520, 1998, pp. 87–101.
Dauz`ere-P ´er`es, S., “Minimizing late jobs in the general one machine scheduling problem, ”European Journal of Operational Research, 81, 134–142 (1995).
Dauz`ere-P ´er`es, S. and M. Sevaux, “Various mathematical programming formulations for a general one machine sequencing problem, ”JNPC' 98, 4 i`eme Journ ´ees Nationales pour la R ´esolution Pratique de Probl`emes NP-Complets, Ecole des Mines, Nantes, France, 1998, pp. 63–68. Research Report 98/3/AUTO.
Dauz`ere-P ´er`es, S. and M. Sevaux, “Using lagrangean relaxation to minimize the weighted number of late jobs on a single machine, ”Naval Research Logistics, 50 (3), 273–288 (2002).
Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, Annals of Discrete Mathematics, 5, 287–326 (1979).
Kise, H., T. Ibaraki, and H. Mine, “A solvable case of the one-machine scheduling problem with read and due times, ” Operations Research, 26(1), 121–126 (1978).
Lawler, E. L., “Scheduling a single machine to minimize the number of late jobs, ”Preprint, Computer Science Division, University of California, Berkeley, 1982.
Lawler, E. L., “Knapsack-like scheduling problems, the Moore-Hodgson Algorithm and the 'Tower of Sets' property, ” Mathematical Computer Modelling, 20 (2), 91–106 (1994).
Lenstra, J. K., A. H. G. Rinnooy Kan, and P. Brucker, “Complexity of machine scheduling problems, ”Annals of Discrete Mathematics, 1, 343–362 (1977).
Moore, J. M., “A n job, one machine sequencing algorithm for minimizing the number of late jobs, ”Management Science, 15(1), 102–109 (1968).
Sevaux, M., “Etude de deux probl`emes d' optimisation en plani cation et ordonnancement, ”Ph. D. Thesis, Universit ´e Pierre et Marie Curie, Paris, 1998.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dauzère-Pérès, S., Sevaux, M. An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling. Journal of Scheduling 7, 405–420 (2004). https://doi.org/10.1023/B:JOSH.0000046073.05827.15
Issue Date:
DOI: https://doi.org/10.1023/B:JOSH.0000046073.05827.15