Common due dates

Bagchi, U., Sullivan, R.S. and Chang, Y.L., 1986. Minimizing mean absolute deviation of completion times about a common due date. Naval Research Logistics Quarterly, 33, 227-240. 

De, P, Ghosh, J.B. and Wells, C.E., 1991. Scheduling to minimize weighted earliness and tardiness about a common due-date. Computers Operations Research, 18(5), 465 75. De, R, Ghosh, J.B. and Wells, C.E., 1993. On the general solution for a class of early/tardy problems. Computers Operations Research, 20(2), 141-149. 

Hall, N.G. and Posner, M.E., 1991. Earliness-tardiness scheduling problems, I weighted deviation of completion times about a common due date. Operations Research, 39(5), 836-846. 

Hoogeveen, J.A. and van de Velde, S.L., 1991. Scheduling around a small common due date. European Journal of Operational Research, 55,237-242. 

Gordon, Valery, Jean-Marie Proth and Chengbin Chu (2002). A Survey of the state-of-art common due date assignment and scheduling research , European Journal of Operational Research, 139, 1-25. 

Common V5. distinct due dates In case of common due dates, all customers who are currently in the system are quoted the same due date. In case of distinct due dates, different due dates can be quoted to different customers. 

Under the assumption of equal job arrival times, a number of authors have studied the common due date problem (CON), where all the jobs are assigned a common due date d and the goal is to jointly determine the common due date and a sequence [3] [11] [21] [24] [76] [81] [80]. The objective functions considered in these papers can be characterized by the following general function of earliness, tardiness and the due date /3jEj + yjTj + ajd. In most... 

T.C.E. Cheng. An alternative proof of optimality for the common due-date assignment problem. European Journal of Operational Research,... 

S. Panwalkar, M. Smith, and A. Seidmann. Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research, 30(l) 391-399, 1982. 

Herrmann and Lee (1993), Chen (1996), and Yuan (1996) study different cases of a problem with a single machine, a common due date shared by all the jobs, and the objective of minimization of the sum of total weighted earliness and tardiness of jobs and total delivery cost. Herrmann and Lee consider the case with the common due date given in advance and jobs have an identical earliness weight and an identical tardiness weight. They give a pseudo-... 

Chen, Z.-L., Scheduling and Common Due Date Assignment with Earliness-Tardiness Penalties and Batch Delivery Costs , European Journal of Operational Research, 93 (1996), 49-60. 

Herrmann, J.W. and C.-Y Lee, On Scheduling to Minimize Earliness-Tardiness and Batch Delivery Costs with a Common Due Date , European Journal of Operational Research, 70 (1993), 272-288. 

There were many SET literatures after Sidney (1977), and they are well summarized by Baker and Scudder (1990), in which it was emphasized that though most of the earliness/tardiness studies avoid the issue of the idle time inserted between jobs either by assuming a common due date for all jobs or by restricting the solution to be a nondelay schedule, the essence of the earliness/tardiness problem lies in its nonregular performance measure, and so, imposing the arbitrary restriction that there be no idle time declines the importance of this objective. Kanet and Sridharan (2000) focused on the inserted idle time (abbreviated to IIT) in scheduling problems and reviewed the earliness/tardiness literature with IIT. 

---