Two due date assignment problems in scheduling a single machine

Operations Research Letters

Volumn 34, Issue 6, 2006, Pages 683-691

  Shabtay, Dvir ^a   Steiner, George ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

Due date assignment; Single machine scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; POLYNOMIALS; SCHEDULING;

DUE DATE ASSIGNMENT; SCHEDULING PROBLEMS; SINGLE-MACHINE SCHEDULING;

PROBLEM SOLVING;

EID: 33747147410     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.10.009     Document Type: Article

References (24)

1. Bagchi U., Sullivan R.S., and Chang Y.L. Minimizing mean absolute deviation of completion times about a common due date. Naval Res. Logistics 33 (1986) 227-240
2. Bagchi U., Sullivan R.S., and Chang Y.L. Minimizing mean squared deviation of completion times about a common due date. Manage. Sci. 33 (1986) 894-906
3. Baker K.R., and Scudder G.D. Sequencing with earliness and tardiness penalties: a review. Oper. Res. 38 (1990) 22-36
4. Birman M., and Mosheiov G. A note on due-date assignment in a two-machine flow-shop. Comput. Oper. Res. 31 3 (2004) 473-480
5. Chen Z.L. Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. Eur. J. Oper. Res. 93 (1996) 49-60
6. Cheng T.C.E., and Kovalyov M.Y. Batch scheduling and common due-date assignment on a single machine. Discrete Appl. Math. 70 (1996) 231-245
7. De P., Ghosh J.B., and Wells C.E. Optimal delivery time quotation and order sequencing. Decision Sci. 22 (1991) 379-390
8. Du J.Y., and Leung T. Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15 (1990) 483-495
9. Gordon V., Proth J.M., and Chu C.B. A survey of the state-of-the-art of common due date assignment and scheduling research. Eur. J. Oper. Res. 139 (2002) 1-25
10. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5 (1979) 287-326
11. Hall N.G., and Posner M.E. Earliness-tardiness scheduling problems 1: weighted deviation of completion times about a common due date. Oper. Res. 39 (1991) 836-846
12. Kahlbacher H.G., and Cheng T.C.E. Parallel machine scheduling to minimize costs for earliness and number of tardy jobs. Discrete Appl. Math. 47 (1993) 139-164
13. Karp R.M. Reducibility among combinatorial problems. Complexity of Computer Computations (1972), Plenum Press, NY
14. Lawler E.L. A pseudopolynomial time algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1 (1977) 331-342
15. Mosheiov G. A common due-date assignment problem on parallel identical machines. Comput. Oper. Res. 28 8 (2001) 719-732
16. Panwalkar S.S., and Rajagopalan R. Single-machine sequencing with controllable processing times. Eur. J. Oper. Res. 59 (1992) 298-302
17. Panwalkar S.S., Smith M.L., and Seidmann A. Common due date assignment to minimize total penalty for the one machine scheduling problem. Oper. Res. 30 (1982) 391-399
18. Papadimitriu C.H., and Steiglitz K. Combinatorial Optimization: Algorithms and Complexity (1982), Prentice-Hall, Englewood Cliffs, NJ
19. Potts C.N., and Van Wassenhove L.N. A branch and bound algorithm for the total weighted tardiness problem. Oper. Res. 33 (1985) 363-377
20. Sahni S. Algorithms for scheduling independent tasks. J. Assoc. Comput. Mach. 23 (1976) 116-127
21. Seidmann A., Panwalkar S.S., and Smith M.L. Optimal assignment of due dates for a single processor scheduling problem. Int. J. Prod. Res. 19 (1981) 393-399
22. Slotnick S.A., and Sobel M.J. Manufacturing lead-time rules: customer retention versus tardiness costs. Eur. J. Oper. Res. 169 (2005) 825-856
23. Smith W.E. Various optimizers for single-stage production. Naval Res. Logistics Q. 3 (1956) 59-66
24. Tapan S., Sulek J.M., and Parthasarati D. Static scheduling research to minimize weighted and unweighted tardiness: a state-of-the-art. Int. J. Prod. Econ. 83 1 (2003) 1-12