A “pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness

Annals of Discrete Mathematics

Volumn 1, Issue C, 1977, Pages 331-342

  Lawler, Eugene L ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957077792     PISSN: 01675060     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0167-5060(08)70742-8     Document Type: Article

References (15)

1. Baker, K.R., Introduction to Sequencing and Scheduling, 1974, Wiley, New York.
2. Elmahgraby, S., The one-machine sequencing problem with delay costs. J. Industrial Eng. 19 (1974), 187–199.
3. Emmons, H., One-machine sequencing to minimize certain functions of job tardiness. Operations Res. 17 (1969), 701–715.
4. Garey, M.R., Johnson, D.S., Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comp. 4 (1975), 397–411.
5. Held, M., Karp, R.M., A dynamic programming approach to sequencing problems. J. Soc. Industr. Appl. Math. 10 (1962), 196–210.
6. Karp, R.M., On the computational complexity of combinatorial problems. Networks 5 (1975), 45–68.
7. Lawler, E.L., Sequencing problems with deferral costs. Management Sc. 11 (1964), 280–288.
8. Lawler, E.L., Optimal sequencing of a single processor subject to precedence constraints. Management Sc. 19 (1973), 544–546.
9. E.L. Lawler, Seauencing to minimize the weighted number of tardy jobs, to appear in Rev. Fransçaise Automat. Informat. Recherche Opérationnelle, Suppl. to 10 (1976) 27–33.
10. Lawler, E.L., Moore, J.M., A functional equation and its application to resource allocation and sequencing problems. Management Sc. 16 (1969), 77–84.
11. Moore, J.M., An n job, one machine scheduling algorithm for minimizing the number of late jobs. Management Sci. 1 (1968), 102–109.
12. Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P., Complexity of machine scheduling problems. Ann. Discrete Math. 1 (1977), 343–362.
13. Rinnooy Kan, A.H.G., Lageweg, B.J., Lenstra, J.K., Minimizing total costs in one-machine scheduling. Operations Res. 23 (1975), 908–927.
14. Smith, W.E., Various optimizers for single-stage production, Naval Res. Logistics Quarterly 3 (1956), 59–66.
15. Srinivasan, V., A hybrid algorithm for the one-machine sequencing problem to minimize total tardiness. Naval Res. Logistics Quarterly 18 (1971), 317–327.