Minimizing total tardiness in an unrelated parallel-machine scheduling problem

We consider a problem of scheduling n independent jobs on m unrelated parallel machines with the objective of minimizing total tardiness. Processing times of a job on different machines may be different on unrelated parallel-machine scheduling problems. We develop several dominance properties and lower bounds for the problem, and suggest a branch and bound algorithm using them. Results of computational experiments show that the suggested algorithm gives optimal solutions for problems with up to five machines and 20 jobs in a reasonable amount of CPU time.

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

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

[3]  Meral Azizoglu,et al.  An efficient algorithm for the single machine tardiness problem , 1994 .

[4]  Jatinder N. D. Gupta,et al.  Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time , 2003, J. Oper. Res. Soc..

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

[6]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[7]  Frank Proschan,et al.  A review: The arrangement increasing partial ordering , 1995, Comput. Oper. Res..

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

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

[10]  Yeong-Dae Kim,et al.  A backward approach in list scheduling algorithms for multi-machine tardiness problems , 1995, Comput. Oper. Res..

[11]  Jeya Chandra,et al.  An integrated inventory model for a single product and its raw materials , 1987 .

[12]  Moon-Won Park A Genetic Algorithm for the Parallel-Machine Total Weighted Tardiness Problem , 2000 .

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

[14]  T.C.E. Cheng,et al.  Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties , 1994 .

[15]  Chun-Yuan Cheng,et al.  Scheduling unrelated parallel machines to minimize total weighted tardiness , 2003, 2006 IEEE International Conference on Service Operations and Logistics, and Informatics.

[16]  Hyo-Heon Ko,et al.  A Scheduling Scheme for Restricted Parallel Machines with Cycling Process , 2004 .

[17]  Ari P. J. Vepsalainen Priority rules for job shops with weighted tardiness costs , 1987 .

[18]  Meral Azizoglu,et al.  Scheduling jobs on unrelated parallel machines to minimize regular total cost functions , 1999 .

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

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

[21]  Yeong-Dae Kim,et al.  On the superiority of a backward approach in list scheduling algorithms for multi-machine makespan problems , 1987 .

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

[23]  Ram Mohan V. Rachamadugu,et al.  Technical Note - A Note on the Weighted Tardiness Problem , 1987, Oper. Res..