A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times

This article addresses the problem of minimizing the sum of maximum earliness and tardiness on a single machine with unequal release times. It is proven that this problem is NP-hard in the strong sense and a branch-and-bound algorithm is developed as an exact method. In the proposed algorithm, modified dispatching rules based on different release times are proposed as the upper bound, while a procedure considering preemption assumption is used to obtain a good lower bound. Also, dominance rules based on no unforced idle time, adjacent pairwise interchanges in the base problem, and job blocks are used to fathom the nodes. In order to evaluate the efficiency of the proposed algorithm, 4,860 instances were randomly generated, varying from 7 to 1,000 jobs. It is shown that the branch-and-bound algorithm was capable of optimally solving 94.1% of the instances, showing its efficiency in solving all problem sizes.

[1]  T. S. Abdul-Razaq,et al.  Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .

[2]  J. Carlier.  The one-machine sequencing problem , 1982 .

[3]  Amir Azaron,et al.  Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert , 2005, Appl. Math. Comput..

[4]  Ghasem Moslehi,et al.  AN OPTIMUM ALGORITHM FOR SINGLE MACHINE WITH EARLY/TARDY COST , 2000 .

[5]  Jorge M. S. Valente.  Dispatching heuristics for the single machine early/tardy scheduling problem with job-independent penalties , 2007, Comput. Ind. Eng..

[6]  Chengbin Chu,et al.  A survey of the state-of-the-art of common due date assignment and scheduling research , 2002, Eur. J. Oper. Res..

[7]  Jin Wang,et al.  OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES , 1988 .

[8]  Jose A. Ventura,et al.  Single machine scheduling with symmetric earliness and tardiness penalties , 2003, Eur. J. Oper. Res..

[9]  Chung-Lun Li,et al.  The parallel machine min-max weighted absolute lateness scheduling problem , 1994 .

[10]  Amir Azaron,et al.  A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert , 2006, Appl. Math. Comput..

[11]  Jorge M. S. Valente,et al.  Improved heuristics for the early/tardy scheduling problem with no idle time , 2005, Comput. Oper. Res..

[12]  Kenneth R. Baker,et al.  Sequencing with due-dates and early start times to minimize maximum tardiness , 1974 .

[13]  Jorge M. S. Valente,et al.  Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time , 2005, Comput. Ind. Eng..

[14]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

[15]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[16]  M. Azizoglu,et al.  Bicriteria scheduling problem involving total tardiness and total earliness penalties , 1991 .

[17]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

[18]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[19]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[20]  Tung-I Tsai,et al.  A genetic algorithm for solving the single machine earliness/tardiness problem with distinct due dates and ready times , 2007 .

[21]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[22]  Rym M'Hallah,et al.  Minimizing total earliness and tardiness on a single machine using a hybrid heuristic , 2007, Comput. Oper. Res..

[23]  Jeffrey B. Sidney,et al.  Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1977, Oper. Res..

[24]  Jorge M. S. Valente,et al.  Improved lower bounds for the early/tardy scheduling problem with no idle time , 2005, J. Oper. Res. Soc..

[25]  Vinícius Amaral Armentano,et al.  A heuristic for single machine scheduling with early and tardy costs , 2001, Eur. J. Oper. Res..

[26]  Jorge M. S. Valente,et al.  Improved Lower Bounds for the Single Machine Earliness/Tardiness Scheduling Problem with Release Dates , 2005 .

[27]  Maria Teresa Almeida,et al.  A composite heuristic for the single machine early/tardy job scheduling problem , 1998, Comput. Oper. Res..

[28]  George Z. Li.  Single machine earliness and tardiness scheduling , 1997 .

[29]  Jorge M. S. Valente,et al.  Heuristics for the Early/Tardy Scheduling Problem with Release Dates , 2007 .

[30]  Daniel Oron,et al.  Minmax scheduling with job-classes and earliness-tardiness costs , 2007, Eur. J. Oper. Res..

[31]  T. C. Edwin Cheng,et al.  Common due date assignment and scheduling with ready times , 2002, Comput. Oper. Res..

[32]  Jorge M. S. Valente,et al.  An exact approach to early/tardy scheduling with release dates , 2005, Comput. Oper. Res..

[33]  Zheng Zhou,et al.  A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems , 1996 .

[34]  Ching-Fang Liaw,et al.  A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem , 1999, Comput. Oper. Res..

[35]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..