Using short-term memory to minimize the weighted number of late jobs on a single machine

European Journal of Operational Research

Volumn 148, Issue 3, 2003, Pages 591-603

  Péridy, Laurent ^a   Pinson, EΈric ^a   Rivreau, David ^a  

^a Institut de Mathématiques Appliquées   (France)

Author keywords

Branch and bound; Dynamic programming; Lagrangean relaxation; Release times; Scheduling; Time indexed formulation; Weighted number of late jobs

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; JOB ANALYSIS; POLYNOMIALS; SCHEDULING;

SHORT-TERM MEMORY;

OPERATIONS RESEARCH;

EID: 0037411867     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00438-1     Document Type: Article

References (23)

1. Abdul-Razaq T.S., Potts C.N. Dynamic programming state-space relaxation for single-machine scheduling. Journal of the Operational Research Society. 39:1988;141-152.
2. van den Akker J.M., Hurkens C.A.J., Savelsbergh M.W.P. Time-indexed formulations for machine scheduling problems: Column generation. INFORMS Journal on Computing. 12(2):2000;111-124.
3. Ph. Baptiste, A. Jouglet, C. Le Pape, W. Nuijten, A constrained-based approach to minimize the weighted number of late jobs on parallel machines, Research Report 2000/288, Université de Technologie de Compiègne, 2000.
4. Ph. Baptiste, C. Le Pape, L. Péridy, 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, p. 1520.
5. Ph. Baptiste, L. Péridy, É. Pinson, A branch and bound to minimize the number of late jobs on a single machine with release time constraints, European Journal of Operations Research, in press.
6. Carlier J. The one-machine sequencing problem. European Journal of Operations Research. 11:1982;42-47.
7. Carlier J., Pinson É. A practical use of Jackson's preemptive schedule for solving the job-shop problem. Annals of Operations Research. 26:1990;269-287.
8. Carlier J., Pinson É Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research. 78:1994;146-161.
9. S. Dauzère-Pérès, M. Sevaux, An exact method to minimize the number of late jobs in single machine scheduling, Technical Report 98/5 and 99/6/auto, École des Mines de Nantes, France, 1998.
10. S. Dauzère-Pérès, M. Sevaux, Genetic algorithms to minimize the weighted number of late jobs on a single machine, European Journal of Operational Research, in press.
11. Fisher M.L. A dual algorithm for the one-machine scheduling problem. Mathematical Programming. 11:1976;229-251.
12. Held M., Wolfe P., Crowder H.P. Validation of subgradient optimization. Mathematical Programming. 6:1974;62-88.
13. 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.
14. Lawler E.L. Sequencing to minimize the weighted number of tardy jobs. RAIRO Operations Research. 10:1976;27-33.
15. Lawler E.L. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the weighted number of late jobs. Annals of Operations Research. 26:1990;125-133.
16. Lawler E.L. Knapsack-like scheduling problems, the Moore-Hogdson algorithm and the 'tower of sets' property. Mathematical and Computer Modelling. 20(2):1994;91-106.
17. Lenstra J.K., Rinnooy Kan A.H.G., Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics. 1:1977;343-362.
18. Moore J. An n job one machine sequencing algorithm for minimizing the number of late jobs. Management Science. 15(1):1968;102-109.
19. Potts C.N., van Wassenhove L. Algorithms for scheduling a single machine to minimize the weighted number of late jobs. Management Science. 34(7):1988;843-858.
20. Picard J.-C., Queyranne M. The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Operations Research. 26:1978;86-110.
21. Sahni S. Algorithms for scheduling independent tasks. Journal of the Association for Computing Machinery. 23:1976;116-127.
22. J.P. Sousa, Time Indexed Formulation of Non-Preemptive Single-Machine Scheduling Problems, Ph.D. Thesis, Université Catholique de Louvain, Belgium, 1989.
23. Villarreal F., Bulfin R. Scheduling a single machine to minimize the weighted number of tardy jobs. AIIE Transactions. 15:1983;337-343.