Single machine scheduling with discretely controllable processing times

Operations Research Letters

Volumn 21, Issue 2, 1997, Pages 69-76

  Chen, Zhi Long ^a   Lu, Qing ^b   Tang, Guochun ^c  

^a Princeton University   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c SHANGHAI SECOND POLYTECHNIC UNIVERSITY   (China)

Author keywords

Discretely controllable processing times; Dynamic programming; NP hardness; Single machine scheduling

Indexed keywords

EID: 0002823839     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(97)00010-2     Document Type: Article

References (20)

1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. B. Alidaee, A. Ahmadian, Two parallel machine sequencing problems involving controllable job processing times, European J. Oper. Res. 70 (1993) 335-341.
3. K.R. Baker, G.D. Scudder, Sequencing with earliness and tardiness penalties: a review, Oper. Res. 38 (1990) 22-36.
4. T.C.E. Cheng, Z.-L. Chen, C.-L. Li, Parallel machine scheduling with controllable processing times, IIE Trans. 28 (1996) 177-180.
5. T.C.E. Cheng, Z.-L. Chen, C.-L. Li, Single-machine scheduling with trade-off between number of tardy Jobs and resource allocation, Oper. Res. Lett. 19 (1996) 237-242.
6. T.C.E. Cheng, Z.-L. Chen, C.-L. Li and B.M.T. Lin, Scheduling to minimize the total compression and late costs, in submission.
7. R.L. Daniels, J.B. Mazzola, Flow shop scheduling with resource flexibility, Oper. Res. 42 (1994) 504-522.
8. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Hardness, Freeman, San Francisco, CA, 1978.
9. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math. 5 (1979) 287-326.
10. N.G. Hall, W. Kubiak, S.P. Sethi, Earliness-tardiness scheduling problems, II: deviation of completion times about a common due date, Oper. Res 39 (1991) 847-856.
11. R.M. Karp, in: R.E. Miller, J.W. Thatcher (Eds.), Reducibility among Combinatorial Algorithms, Complexity of Computer Computations, Plenum, New York, 1972.
12. J.M. Moore, An n job, one-machine sequencing algorithm for minimizing the number of late jobs, Management Science 15 (1968) 334-342.
13. E. Nowicki, S. Zdrzalka, A survey of results for sequencing problems with controllable processing times, Discrete Appl. Math. 25 (1990) 271-287.
14. S.S. Panwalkar, R. Rajagoplan, Single-machine sequencing with controllable processing times, European J. Oper. Res. 59 (1992) 298-302.
15. S.S. Panwalkar, M.L. Smith, A. Seidman, Common due date assignment to minimize total penalty cost for the one-machine scheduling problem, Oper. Res. 30 (1982) 391-399.
16. M. Trick, Scheduling multiple variable-speed machines, Oper. Res. 42 (1994) 234-248.
17. L.N. Van Wassenhove, K.R. Baker, A bicriterion approach to time/cost trade-offs in sequencing, European J. Oper. Res. 11 (1982) 48-52.
18. R.G. Vickson, Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine, Oper. Res, 28 (1980) 1155-1167.
19. R.G. Vickson, Two single machine sequencing problems involving controllable job processing times, AIIE Trans. 12 (1980) 258-262.
20. S. Zdrzalka, Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis, Oper. Res. Lett, 10 (1991) 519-524.