Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms

The concept of parallel machines has been widely used in manufacturing. This article proposes a genetic algorithm (GA) approach to minimize total tardiness of a set of tasks for identical parallel machines and worker assignment to machines. A spreadsheet-based GA approach is presented to solve the problem. A domain-independent general purpose GA is used, which is an add-in to the spreadsheet software. The paper demonstrates an adaptation of the proprietary GA software to the problem of minimizing total tardiness for the worker assignment scheduling problem for identical parallel machine models. Two 100 I/P/n/m/W problems taken from Hu (Int J Adv Manuf Technol 23:383–388, 2004, Int J Adv Manuf Technol 29:165–169, 2006) for a similar study are simulated. The performance of GA is superior to SES-A/LMC approach used by Hu and very close to the Exhaustive search procedure. It is shown that the spreadsheet GA implementation makes it very easy to adapt the problem for any set of objective measures without changing the actual model. Empirical analysis has been carried out to study the effect of GA parameters, namely, crossover rate, mutation rate, and the population size.

[1]  Liu Min,et al.  Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems , 2006 .

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

[3]  P. Chang,et al.  A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem , 2006 .

[4]  Congxin Li,et al.  Research on immune genetic algorithm for solving the job-shop scheduling problem , 2007 .

[5]  Yugeng Xi,et al.  Robust and stable scheduling of a single machine with random machine breakdowns , 2006 .

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

[7]  Paul R. Drake,et al.  Minimizing flow-time variance in a single-machine system using genetic algorithms , 2008 .

[8]  Johnny C. Ho,et al.  Minimizing the number of tardy jobs for m parallel machines , 1995 .

[9]  Angelika Steger,et al.  Approximability of scheduling with fixed jobs , 1999, SODA '99.

[10]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[11]  Yash P. Gupta,et al.  Minimizing flow time variance in a single machine system using genetic algorithms , 1993 .

[12]  Yeong-Dae Kim,et al.  A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property , 2008, Comput. Oper. Res..

[13]  In-Jae Jeong,et al.  Flow shop scheduling with no-wait flexible lot streaming using an adaptive genetic algorithm , 2009 .

[14]  Johnny Wong,et al.  Makespan minimization for m parallel identical processors , 1995 .

[15]  Byung-Cheon Choi,et al.  Maximizing the weighted number of just-in-time jobs in flow shop scheduling , 2007 .

[16]  Wing-Keung Wong,et al.  A genetic-algorithm-based optimization model for scheduling flexible assembly lines , 2008 .

[17]  Yoshiakira Akimoto,et al.  Genetic algorithms approach to voltage optimization , 1991, Proceedings of the First International Forum on Applications of Neural Networks to Power Systems.

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

[19]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[20]  Meral Azizoglu,et al.  Dynamic programming algorithms for scheduling parallel machines with family setup times , 2001, Comput. Oper. Res..

[21]  Mohamed K. Omar,et al.  Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach , 2006, Appl. Math. Comput..

[22]  Rubén Ruiz,et al.  No-wait flowshop with separate setup times to minimize maximum lateness , 2007 .

[23]  Warren B. Powell,et al.  A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem , 1999, Eur. J. Oper. Res..

[24]  O. V. Krishnaiah Chetty,et al.  A genetic algorithmic approach to multi-objective scheduling in a Kanban-controlled flowshop with intermediate buffer and transport constraints , 2006 .

[25]  A. Noorul Haq,et al.  Parallel line job shop scheduling using genetic algorithm , 2008 .

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

[27]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[28]  Suk-Jae Jeong,et al.  Parallel machine scheduling with earliness-tardiness penalties and space limits , 2008 .

[29]  Funda Sivrikaya-Serifoglu,et al.  Parallel machine scheduling with earliness and tardiness penalties , 1999, Comput. Oper. Res..

[30]  Yeong-Dae Kim,et al.  Scheduling on parallel identical machines to minimize total tardiness , 2007, Eur. J. Oper. Res..

[31]  Yu-Wang Chen,et al.  Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling , 2008 .

[32]  Mitsuo Gen,et al.  Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms , 1995 .

[33]  Darrell Whitley,et al.  Genitor: a different genetic algorithm , 1988 .

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

[35]  Po-Chieng Hu,et al.  Further study of minimizing total tardiness for the worker assignment scheduling problem in the identical parallel-machine models , 2006 .

[36]  Zhi-Long Chen,et al.  Parallel machine scheduling with a common due window , 2002, Eur. J. Oper. Res..

[37]  Hyun Joon Shin,et al.  A scheduling algorithm for the reentrant shop: an application in semiconductor manufacture , 2007 .

[38]  Yeong-Dae Kim,et al.  Minimizing makespan on an m-machine re-entrant flowshop , 2008, Comput. Oper. Res..

[39]  Derya Eren Akyol,et al.  Multi-machine earliness and tardiness scheduling problem: an interconnected neural network approach , 2008 .

[40]  Guoqing Wang,et al.  Parallel machine earliness and tardiness scheduling with proportional weights , 2003, Comput. Oper. Res..

[41]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

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

[43]  Philippe Baptiste,et al.  Scheduling equal-length jobs on identical parallel machines , 2000, Discret. Appl. Math..

[44]  V. P. Arunachalam,et al.  Enhancement of performance of Genetic Algorithm for job shop scheduling problems through inversion operator , 2007 .

[45]  V. Vinod,et al.  Dynamic job-shop scheduling with sequence-dependent setup times: simulation modeling and analysis , 2008 .

[46]  C.S.P. Rao,et al.  A hybrid multi-objective GA for simultaneous scheduling of machines and AGVs in FMS , 2006 .

[47]  Po-Chieng Hu,et al.  Minimising total tardiness for the worker assignment scheduling problem in identical parallel-machine models , 2004 .

[48]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .