A canned food scheduling problem with batch due date

This article considers a canned food scheduling problem where jobs are grouped into several batches. Jobs can be sent to the next operation only when all the jobs in the same batch have finished their processing, i.e. jobs in a batch, have a common due date. This batch due date problem is quite common in canned food factories, but there is no efficient heuristic to solve the problem. The problem can be formulated as an identical parallel machine problem with batch due date to minimize the total tardiness. Since the problem is NP hard, two heuristics are proposed to find the near-optimal solution. Computational results comparing the effectiveness and efficiency of the two proposed heuristics with an existing heuristic are reported and discussed.

[1]  Ricardo Simpson,et al.  Optimal scheduling of canned food plants including simultaneous sterilization , 2009 .

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

[3]  Christos Koulamas.  Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem , 1997 .

[4]  Christos Koulamas,et al.  A heuristic for the single machine tardiness problem , 1993 .

[5]  J. D. Irwin,et al.  An Improved Method for Scheduling Independent Tasks , 1971 .

[6]  Carlos F. Daganzo,et al.  A branch and bound solution method for the crane scheduling problem , 1990 .

[7]  Chien-Hung Lin,et al.  Minimizing makespan on parallel machines with batch arrivals , 2012 .

[8]  Jwm Will Bertrand,et al.  A dynamic priority rule for scheduling against due-dates , 1982 .

[9]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[10]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[11]  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..

[12]  Yih-Long Chang,et al.  Heuristics for minimizing mean tardiness form parallel machines , 1991 .

[13]  Bahram Alidaee,et al.  Scheduling parallel machines to minimize total weighted and unweighted tardiness , 1997, Comput. Oper. Res..

[14]  T.C.E. Cheng,et al.  Single-machine batch delivery scheduling with an assignable common due window , 2013 .

[15]  Shunji Tanaka,et al.  A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines , 2008 .

[16]  Jatinder N. D. Gupta,et al.  Scheduling identical parallel machines to minimize total tardiness , 2008 .

[17]  Ethel Mokotoff,et al.  Production , Manufacturing and Logistics An exact algorithm for the identical parallel machine scheduling problem , 2003 .

[18]  Chengbin Chu,et al.  Parallel machine scheduling to minimize total tardiness , 2002 .

[19]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

[21]  Julius Surkis,et al.  Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors , 1979 .

[22]  Carlos F. Daganzo,et al.  THE CRANE SCHEDULING PROBLEM , 1989 .