A branch and bound to minimize the number of late jobs on a single machine with release time constraints

European Journal of Operational Research

Volumn 144, Issue 1, 2003, Pages 1-11

  Baptiste, Philippe ^a   Peridy, Laurent ^b   Pinson, Eric ^b  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

^b UNIVERSITÉ CATHOLIQUE DE L'OUEST   (France)

Author keywords

Branch and bound; Dominance properties; Elimination rules; Number of late jobs; Single machine scheduling

Indexed keywords

ALGORITHMS; JOB ANALYSIS; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; SCHEDULING;

SINGLE MACHINE SCHEDULING;

OPERATIONS RESEARCH;

EID: 0037209401     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00353-8     Document Type: Article

References (32)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows. 1993;Prentice-Hall, Englewood Cliffs, NJ.
2. 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs Operations Research Letters. 24:1999.
3. Baptiste Ph. Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal. Journal of Scheduling. 2:1999;245-252.
4. Baptiste Ph., Le Pape C., Nuijten W. Constraint-based scheduling: Applying constraint programming to scheduling problems. International Series in Operations Research and Management Science. vol. 39:2001;Kluwer Academic Publishers, Dordrecht.
5. Baptiste Ph., Le Pape C., Peridy L. Global constraints for partials csps: a case study of resource and due date constraints. Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming. Lecture Notes in Computer Science. 1998;Springer, Berlin.
6. Brucker P., Jurisch B., Krämer A. The job-shop problem and immediate selection. Annals of Operations Research. 50:1994.
7. Brucker P., Jurisch B., Sievers B. A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics. 49:1994;107-127.
8. Carlier J. Ordonnancements à machines disjunctives. RAIRO. 12(4):1975.
9. Carlier J. Problème à une machine et algorithmes polynômiaux. Questio. 5(4):1981.
10. Carlier J. The one machine problem. European Journal of Operational Research. 11:1982;42-47.
11. J. Carlier, Problèmes d'ordonnancements à contraintesde ressources: Algorithmes et complexité, Thèse d'État, Ph.D. Thesis, University of Paris VI, 1984.
12. Carlier J., Pinson E. An algorithm for solving the job-shop problem. Management Science. 35(2):1989;165-176.
13. Carlier J., Pinson E. A practical use of jackson's preemptive schedule for solving the job-shop problem. Annals of Operations Research. 26:1991;269-287.
14. Carlier J., Pinson E. Adjustments of heads and tails for the job-shop problem. European Journal of Operational Research. 78:1994;146-161.
15. Y. Caseau, F. Laburthe, Disjunctive scheduling with task intervals, Technical Report, LIENS Technical Report 95-25, ÉcoleNormale Supérieure Paris, France, 1995.
16. Dauzère-Pérès S. Minimizing late jobs in the general one machine scheduling problem. European Journal of Operational Research. 81:1995;134-142.
17. S. Dauzère-Pérès, M. Sevaux, An branch and bound method to minimize the number of late jobs in single machine, Technical Report 98/5/AUTO, Ecole des Mines de Nantes, 1998.
18. S. Dauzère-Pérès, M. Sevaux, A efficient formulation for minimizing the number of late jobs on a single machine, Technical Report 98/9/AUTO, Ecole des Mines de Nantes, 1998.
19. S. Dauzère-Pérès, M. Sevaux, An exact method to minimize the number of tardy jobs on a single machine, Technical Report 99/6/AUTO, Ecole des Mines de Nantes, SDP, MS, 1999.
20. G. Dewess, Ein existenzsatz für packungs probleme mit konsequenzen für die berechnung optimaler maschinenbelegungspläne, Technical report, Universität Leipzig, 1991.
21. Erschler J., Roubellat F., Vernhes J.P. Characterizing the set of feasible sequences for n jobs to be carried out on a single machine. European Journal of Operational Research. 4:1980;189-194.
22. J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Technical Report 43, University of California, Los Angeles, 1955.
23. Kise H., Ibaraki T., Mine H. A solvable case of the one machine scheduling problem with ready and due times. Operations Research. 26(1):1978;121-126.
24. Lawler E.L. A dynamic programming algorithm for the preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research. (26):1990;125-133.
25. Lawler E.L. Knapsack-like scheduling problems, the moore-hodgson algorithm and the "tower of sets" property. Mathematical Computer Modelling. 20(2):1994;91-106.
26. Lenstra J.K., Rinnooy Kan A.H.G., Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics. 1:1977;343-362.
27. P. Lopez, Approche énergétique pour l'ordonnancement de tâches sous contraintes de temps et de ressources, Ph.D. Thesis, Université Paul Sabatier, 1991.
28. P. Martin, D.B. Shmoys, A new approach to computing optimal schedules for the job-shop scheduling problem, in: Proceedings of the fifth Conference on Integer Programming and Combinatorial Optimization, 1996.
29. Minoux M. Mathematical Programming. 1986;Wiley, New York.
30. Moore J.M. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science. 15(1):1968;102-109.
31. L. Peridy, Le problème de Job-Shop: arbitrages et ajustements, Ph.D. Thesis, University of Technology of Compiègne, 1996.
32. D. Rivreau, Problèmes d'ordonnancement disjonctifs: règles d'élimination et bornes inférieures, Ph.D. Thesis, University of Technology of Compiègne, 1999.