SCHEDULING ON A SINGLE MACHINE WITH FAMILY SETUPS TO MINIMIZE TOTAL TARDINESS

Abstract This paper considers the problem of scheduling on a single machine to minimize total tardiness when family setup times exist. The paper proposes optimal branch-and-bound procedures for the case where the group technology assumption is used and for the case when the group technology assumption is removed. A heuristic procedure is also proposed to solve larger problems with the group technology assumption removed. The procedures were tested on problems of various sizes and parameters. An important finding of the tests is total tardiness can be significantly reduced by removing the group technology assumption when scheduling.

[1]  Jatinder N. D. Gupta,et al.  Batch scheduling to minimize maximum lateness , 1997, Oper. Res. Lett..

[2]  Clyde L. Monma,et al.  On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..

[3]  Stanisław Zdrzałka.  Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times , 1995 .

[4]  T. C. Edwin Cheng,et al.  The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard , 2003, J. Sched..

[5]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[6]  Chris N. Potts,et al.  Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs , 1996 .

[7]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[8]  Chris N. Potts,et al.  Single machine scheduling with batch set-up times to minimize maximum lateness , 1997, Ann. Oper. Res..

[9]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[10]  Tapan Sen,et al.  Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey , 2003 .

[11]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[12]  Yeong-Dae Kim,et al.  A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..

[13]  N. Nakamura,et al.  Group production scheduling for minimum total tardiness Part(I) , 1978 .