Single machine scheduling with assignable due dates

Discrete Applied Mathematics

Volumn 122, Issue 1-3, 2002, Pages 211-233

  Qi, Xiangtong ^a   Yu, Gang ^a   Bard, Jonathan F ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b The University of Texas at Austin   (United States)

Author keywords

Assignment of due dates; Assignment of release times; Computational complexity; Generalized due dates; NP complete; Single machine scheduling

Indexed keywords

EID: 84867971809     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00316-X     Document Type: Article

References (23)

1. K.R. Baker, and G.D. Scudder Sequencing with earliness and tardiness penalties: a review Oper. Res. 38 1990 22 36
2. Z.-L. Chen Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs European J. Oper. Res. 93 1996 49 60
3. T.C.E. Cheng, V.S. Gordon, and M.Y. Kovalyov Single machine scheduling with batch deliveries European J. Oper. Res. 94 1996 277 283
4. T.C.E. Cheng, and M.C. Gupta Survey of scheduling research involving due-date determination decisions European J. Oper. Res. 38 1989 156 166
5. T.C.E. Cheng, and M.Y. Kovalyov Batch scheduling and common due-date assignment on a single machine Discrete Appl. Math. 70 1996 231 245
6. T.C.E. Cheng, and M.Y. Kovalyov Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness European J. Oper. Res. 114 1999 403 410
7. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman & Company San Francisco
8. V. Gordon, and W. Kubiak Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs Inform. Process. Lett. 68 1998 153 159
9. V. Gordon, and V.A. Strusevich Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment Comput. Oper. Res. 26 1999 157 177
10. N.G. Hall Scheduling problems with generalized due dates IIE Trans. 18 1986 220 222
11. N.G. Hall, W. Kubiak, and S.P. Sethi Earliness-tardiness scheduling problems, II: deviation of completion times about a restrictive common due date Oper. Res. 39 1991 847 856
12. N.G. Hall, M. Lesaoana, and C.N. Potts Scheduling with fixed delivery dates Oper. Res. 49 2001 134 144
13. N.G. Hall, S.P. Sethi, and C. Sriskandarajah On the complexity of generalized due date scheduling problems European J. Oper. Res. 51 1991 100 109
14. J.W. Herrmann, and C.-Y. Lee On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date European J. Oper. Res. 70 1993 272 288
15. H.G. Kahlbacher, and T.C.E. Cheng Processing-plus-wait due-dates in single machine scheduling J. Optim. Theory Appl. 85 1995 163 186
16. M.Y. Kovalyov Batch scheduling and common due date assignment problem: an NP-hard case Discrete Appl. Math. 80 1997 251 254
17. J.M. Moore An n-job, one machine sequencing algorithm for minimizing the number of late jobs Management Sci. 15 1968 102 109
18. M. Pinedo Scheduling: Theory, Algorithms and Systems 1995 Prentice-Hall Englewood Cliffs, NJ
19. C. Sriskandarajah A note on the generalized due dates scheduling problems Naval Res. Logist. 37 1990 587 597
20. K. Tanaka, and M. Vlach Single machine scheduling to minimize the maximum lateness with both specific and generalized due dates IEICE Trans. Fund. 80 1997 557 563
21. K. Tanaka, and M. Vlach Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine Ann. Oper. Res. 86 1999 507 526
22. X. Yang Scheduling with generalized batch delivery dates and earliness penalties IIE Trans. 32 2000 735 741
23. G. Yu, S. Dugan, and M. Arguello Moving toward an integrated decision support system for manpower planning at Continental Airlines: optimization on pilot training assignments G. Yu, Industrial Applications of Combinatorial Optimization 1998 Kluwer Academic Publishers Boston 1 24