Single-machine scheduling with trade-off between number of tardy jobs and resource allocation

Operations Research Letters

Volumn 19, Issue 5, 1996, Pages 237-242

  Cheng, T C E ^a   Chen, Z L ^b   Li, Chung Lun ^c  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b Princeton University   (United States)

^c WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Resource allocation; Scheduling; Sequencing; Time cost trade offs

Indexed keywords

EID: 0000726721     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(96)00035-1     Document Type: Article

References (7)

1. R.L. Daniels and R.K. Sarin, "Single machine scheduling with controllable processing times and number of jobs tardy", Oper. Res. 37, 981-984 (1989).
2. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
3. J.M. Moore, "An n job, one-machine sequencing algorithm for minimizing the number of late jobs", Management Sci. 15, 334-342 (1968).
4. E. Nowicki and S. Zdrzalka, "A survey of result for sequencing problems with controllable job processing times", Discrete Appl. Math. 26, 271-287 (1990).
5. L.N. Van Wassenhove and K.R. Baker, "A bicriterion approach to time/cost trade-offs in sequencing", European J. Oper. Res. 11, 48-54 (1982).
6. R.G. Vickson, "Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine", Oper. Res. 28, 1155-1167 (1980).
7. R.G. Vickson, "Two single machine sequencing problems involving controllable job processing times", IIE Trans. 12, 258-262 (1980).