Two due date assignment problems in scheduling a single machine

Bagchi, 1986, Minimizing mean absolute deviation of completion times about a common due date, Naval Res. Logistics, 33, 227, 10.1002/nav.3800330206 Bagchi, 1986, Minimizing mean squared deviation of completion times about a common due date, Manage. Sci., 33, 894, 10.1287/mnsc.33.7.894 Baker, 1990, Sequencing with earliness and tardiness penalties: a review, Oper. Res., 38, 22, 10.1287/opre.38.1.22 Birman, 2004, A note on due-date assignment in a two-machine flow-shop, Comput. Oper. Res., 31, 473, 10.1016/S0305-0548(02)00225-3 Chen, 1996, Scheduling and common due date assignment with earliness–tardiness penalties and batch delivery costs, Eur. J. Oper. Res., 93, 49, 10.1016/0377-2217(95)00133-6 Cheng, 1996, Batch scheduling and common due-date assignment on a single machine, Discrete Appl. Math., 70, 231, 10.1016/0166-218X(96)80468-9 De, 1991, Optimal delivery time quotation and order sequencing, Decision Sci., 22, 379, 10.1111/j.1540-5915.1991.tb00353.x Du, 1990, Minimizing total tardiness on one machine is NP-hard, Math. Oper. Res., 15, 483, 10.1287/moor.15.3.483 Gordon, 2002, A survey of the state-of-the-art of common due date assignment and scheduling research, Eur. J. Oper. Res., 139, 1, 10.1016/S0377-2217(01)00181-3 Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math., 5, 287, 10.1016/S0167-5060(08)70356-X Hall, 1991, Earliness–tardiness scheduling problems 1: weighted deviation of completion times about a common due date, Oper. Res., 39, 836, 10.1287/opre.39.5.836 Kahlbacher, 1993, Parallel machine scheduling to minimize costs for earliness and number of tardy jobs, Discrete Appl. Math., 47, 139, 10.1016/0166-218X(93)90088-6 Karp, 1972, Reducibility among combinatorial problems Lawler, 1977, A pseudopolynomial time algorithm for sequencing jobs to minimize total tardiness, Ann. Discrete Math., 1, 331, 10.1016/S0167-5060(08)70742-8 Mosheiov, 2001, A common due-date assignment problem on parallel identical machines, Comput. Oper. Res., 28, 719, 10.1016/S0305-0548(99)00127-6 Panwalkar, 1992, Single-machine sequencing with controllable processing times, Eur. J. Oper. Res., 59, 298, 10.1016/0377-2217(92)90144-X Panwalkar, 1982, Common due date assignment to minimize total penalty for the one machine scheduling problem, Oper. Res., 30, 391, 10.1287/opre.30.2.391 Papadimitriu, 1982 Potts, 1985, A branch and bound algorithm for the total weighted tardiness problem, Oper. Res., 33, 363, 10.1287/opre.33.2.363 Sahni, 1976, Algorithms for scheduling independent tasks, J. Assoc. Comput. Mach., 23, 116, 10.1145/321921.321934 Seidmann, 1981, Optimal assignment of due dates for a single processor scheduling problem, Int. J. Prod. Res., 19, 393, 10.1080/00207548108956667 Slotnick, 2005, Manufacturing lead-time rules: customer retention versus tardiness costs, Eur. J. Oper. Res., 169, 825, 10.1016/j.ejor.2003.07.023 Smith, 1956, Various optimizers for single-stage production, Naval Res. Logistics Q., 3, 59, 10.1002/nav.3800030106 Tapan, 2003, Static scheduling research to minimize weighted and unweighted tardiness: a state-of-the-art, Int. J. Prod. Econ., 83, 1, 10.1016/S0925-5273(02)00265-7