An improved earliness-tardiness timing algorithm

Earliness-tardiness criteria with distinct due dates usually induce NP-complete problems. Researchers have focused on particular cases like the timing problem, which is to look for the optimal schedule when the jobs sequence is already known. These timing algorithms are very useful since they can be used in more complex procedures. In the first part of this paper we provide the most efficient and fairly general algorithm to solve the one-machine timing problem. It is then adapted to a permutation flow shop problem.

[1]  Federico Della Croce,et al.  Optimal idle time insertion in early-tardy parallel machines scheduling with precedence constraints , 2002 .

[2]  Leyuan Shi,et al.  Dual constrained single machine sequencing to minimize total weighted completion time , 2005, IEEE Transactions on Automation Science and Engineering.

[3]  Francis Sourd,et al.  PERT scheduling with convex cost functions , 2003, Theor. Comput. Sci..

[4]  Nilotpal Chakravarti,et al.  Isotonic Median Regression: A Linear Programming Approach , 1989, Math. Oper. Res..

[5]  Roberto da Costa Quinino,et al.  An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions , 2005, Comput. Oper. Res..

[6]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[7]  Ross J. W. James,et al.  A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem , 1997 .

[8]  Benjamin P.-C. Yen,et al.  Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties , 2002, Eur. J. Oper. Res..

[9]  Francis Sourd,et al.  Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem , 2006, Eur. J. Oper. Res..

[10]  Ravindra K. Ahuja,et al.  A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints , 2001, Oper. Res..

[11]  John J. Kanet,et al.  Single-machine scheduling with early and tardy completion costs , 1993 .

[12]  Robert E. Tarjan,et al.  One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..

[13]  Wlodzimierz Szwarc,et al.  Optimal timing schedules in earliness-tardiness single machine sequencing , 1995 .

[14]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[15]  Joanna Józefowska,et al.  Minimizing the earliness-tardiness costs on a single machine , 2006, Comput. Oper. Res..

[16]  Erik Demeulemeester,et al.  An Exact Procedure for the Resource-Constrained Weighted Earliness–Tardiness Project Scheduling Problem , 2001, Ann. Oper. Res..

[17]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[18]  Francis Sourd,et al.  Optimal timing of a sequence of tasks with general completion costs , 2005, Eur. J. Oper. Res..