Scheduling on unrelated parallel machines with sequence- and machine-dependent setup times and due-date constraints

We consider the unrelated parallel-machine scheduling problem with sequence- and machine-dependent setup times and due-date constraints. There are N jobs, each having a due date and requiring a single operation on one of the M machines. A setup is required if there is a switch from processing one type of job to another. Due to the characteristics of machines, the processing time depends upon the job and machine on which the job is processed, and the setup time is sequence and machine dependent. In addition, certain jobs have strict due-date constraints. An effective heuristic based on a modified apparent-tardiness-cost-with-setup procedure, the simulated annealing method, and designed improvement procedures is proposed to minimize the total tardiness of this scheduling problem. Computational characteristics of the proposed heuristic are evaluated through an extensive experiment using a newly created data set. Computational results show that the proposed heuristic is able to effectively improve the initial solutions, obtained by a modified apparent-tardiness-cost-with-setup procedure, and obtains better results than a random descent heuristic.

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

[2]  Jeng-Fung Chen.  Minimization of maximum tardiness on unrelated parallel machines with process restrictions and setups , 2006 .

[3]  F. Frank Chen,et al.  Unrelated parallel machine scheduling with setup times using simulated annealing , 2002 .

[4]  V. Suresh,et al.  Minimizing maximum tardiness for unrelated parallel machines , 1994 .

[5]  Young Hoon Lee,et al.  Scheduling jobs on parallel machines applying neural network and heuristic rules , 2000 .

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

[7]  Jeng-Fung Chen,et al.  Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints , 2006 .

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

[9]  Jonathan F. Bard,et al.  A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs , 2008, Eur. J. Oper. Res..

[10]  Jae Kyung Shim,et al.  Scheduling Jobs on Parallel Machines with Sequence-Dependent Family Set-up Times , 2002 .

[11]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[12]  Hyun-Seon Choi,et al.  Scheduling algorithms for parallel machines with sequence-dependent set-up and distinct ready times: Minimizing total tardiness , 2007 .

[13]  Alain Guinet.  Scheduling independent jobs on uniform parallel machines to minimize tardiness criteria , 1995, J. Intell. Manuf..

[14]  M. Azizoglu,et al.  Tardiness minimization on parallel machines , 1998 .

[15]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[16]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

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

[18]  Krishna R. Pattipati,et al.  Schedule generation and reconfiguration for parallel machines , 1990, IEEE Trans. Robotics Autom..

[19]  Michael Pinedo,et al.  Scheduling jobs on parallel machines with sequence-dependent setup times , 1997, Eur. J. Oper. Res..

[20]  José M. Valério de Carvalho,et al.  A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times , 2007, Eur. J. Oper. Res..

[21]  Esther M. Arkin,et al.  Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights , 1991, Oper. Res..

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

[23]  Paveena Chaovalitwongse,et al.  Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria , 2008 .

[24]  Sheldon Howard Jacobson,et al.  The Theory and Practice of Simulated Annealing , 2003, Handbook of Metaheuristics.

[25]  Nagraj Balakrishnan,et al.  Early/tardy scheduling with sequence dependent setups on uniform parallel machines , 1999, Comput. Oper. Res..

[26]  Panos M. Pardalos,et al.  Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times , 2008, Comput. Oper. Res..

[27]  A. Doğramaci.  Production scheduling of independent jobs on parallel identical processors , 1984 .

[28]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[29]  V. J. Leon,et al.  Scheduling with product family set-up times: an application in TFT LCD manufacturing , 2004 .

[30]  Furkan Kiraç,et al.  A tabu search algorithm for parallel machine total tardiness problem , 2004, Comput. Oper. Res..

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

[32]  Vinícius Amaral Armentano,et al.  Tabu search for scheduling on identical parallel machines to minimize mean tardiness , 2000, J. Intell. Manuf..

[33]  C.-H. Kuo,et al.  Evaluating scheduling heuristics for non-identical parallel processors , 1997 .