Early/tardy scheduling

Cheng, R., Gen, M. and Tozawa, T., 1995. Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms. Computers Industrial Engineering, 29, 513-517. 

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. 

Baker and Scudder, 1990). In a JIT enviromnent, both earliness and tardiness must be discouraged, since jobs finished early increase inventory cost while late jobs lead to customers dissatisfaction and loss of business goodwill. Thus an ideal schedule is one in which all jobs finish within the assigned due dates. The objectives of early/tardy (E/T) scheduhng could be interpreted in different ways, for example minimizing total absolute deviation from due dates, job-dependent earhness and tardiness penalties, non-linear penalties, and so forth (see Baker and Scudder, 1990 for a comprehensive survey). 

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. 

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. 

Keywords Scheduling Earliness/tardiness penalty Sequence-dependent setup... 

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. 

To raise reality of the problem, meanwhile, recent studies dealing with the scheduling problems tend to consider the release time of each job. For the SET with the release time, Keyser and Sarper (1991) presented a target starting time heuristic to minimize the sum of earliness, tardiness, and waiting time costs. The heuristic... 

Balakiishnan N, Kanet JJ, Sridhaian V (1999) Eaily/tardy scheduling with sequence dependent setups on uniform parallel machines. Comput Oper Res 26(2) 127-141 Coleman B (1992) Technical note a simple model for optimization the single machine early/tardy problem with problem with sequence-dependent setups. Prod Oper Manage l(2) 225-228 Davis JS, Kanet JJ (1993) Single-machine scheduling with early and tardy completion costs. Naval Res Logistics (NRL) 40(1) 85-101... 

In this work, a comparison between proactive and reactive approaches has been carried out in terms of a new proposed evaluation criterion that considers earliness and tardiness, as well as rescheduling costs. This cost takes into account the total deviation from initial starting times and a batch reallocation cost which is proportional to the objective function. According to the presented case studies, the further from initially considered values uncertainty unveils, the better the reactive schedule performs according to the evaluation criterion. On the contrary, if uncertainty unveils as forecasted, and early in the time horizon, the best choice is the proactive approach. Future work will be focused on the validation and further improvement of the proactive-reactive control scheme. 

Production schedtrhng has been extensively studied, and previous literature has focused more on single regular measures, such as mean flow-time and mean lateness. Since the 1980s, the concept of penalizing both earliness and tardiness has spawned a new and rapidly developing hne of research in the scheduling field... 

Cheng, T.C.E. and Chen, Z.L., 1994. Parallel-machine scheduling problems with earliness and tardiness penalties. Journal of Operational Research Society, 45(6), 685-695. Cheng, T.C.E. and Sin, C.C.S., 1990. A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47,271-292. 

Sidney JB (1977) Optimal single-machine scheduling with earliness and tardiness penalties. Oper Res 25(l) 62-69... 

---