Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems

Abstract Earliness/tardiness scheduling problems with undetermined common due date which have wide application background in textile industry, mechanical industry, electronic industry and so on, are very important in the research fields such as industry engineering and CIMS. In this paper, a kind of genetic algorithm based on sectional code for minimizing the total cost of assignment of due date, earliness and tardiness in this kind of scheduling problem is proposed to determine the optimal common due date and the optimal scheduling policy for determining the job number and their processing order on each machine. Also, simulated annealing mechanism and the iterative heuristic fine-tuning operator are introduced into the genetic algorithm so as to construct three kinds of hybrid genetic algorithms with good performance. Numerical computational results focusing on the identical parallel machine scheduling problem and the general parallel machine scheduling problem shows that these algorithms outperform heuristic procedures, and fit for larger scale parallel machine earliness/tardiness scheduling problem. Moreover, with practical application data from one of the largest cotton colored weaving enterprises in China, numerical computational results show that these genetic algorithms are effective and robust, and that especially the performance of the hybrid genetic algorithm based on simulated annealing and the iterative heuristic fine-tuning operator is the best among them.

[1]  Ceyda Oğuz,et al.  Single Machine Earliness-Tardiness Scheduling Problems Using the Equal—Slack Rule , 1994 .

[2]  Guoyong Shi,et al.  A genetic algorithm applied to a classic job-shop scheduling problem , 1997, Int. J. Syst. Sci..

[3]  Liu Min HYBRID GENETIC ALGORITHM METHOD FOR IDENTICAL PARALLEL MACHINE EARLINESS/TARDINESS SCHEDULING PROBLEM , 2000 .

[4]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

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

[6]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[7]  Wu Cheng,et al.  A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines , 1999, Artif. Intell. Eng..

[8]  T.C.E. Cheng,et al.  A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines , 1989 .

[9]  Dingwei Wang,et al.  Genetic algorithm approach to earliness and tardiness production scheduling and planning problem , 1998 .

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

[11]  Chae Y. Lee,et al.  Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights , 1995 .

[12]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[13]  Cheng Wu,et al.  Scheduling algorithm based on evolutionary computing in identical parallel machine production line , 2003 .

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

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

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

[17]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[18]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[19]  Andreas C. Nearchou,et al.  The effect of various operators on the genetic search for large scheduling problems , 2004 .

[20]  Costas P. Pappis,et al.  Scheduling under a common due-data on parallel unrelated machines , 1998, Eur. J. Oper. Res..

[21]  S. Fang,et al.  A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm , 1996 .

[22]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[23]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[24]  Jose A. Ventura,et al.  Single-machine earliness-tardiness scheduling about a common due date with tolerances , 1996 .

[25]  Jeffrey E. Diamond,et al.  Error bound for common due date assignment and job scheduling on parallel machines , 2000 .

[26]  A. Gupta,et al.  A GENETIC ALGORITHM FOR SCHEDULING JOB FAMILIES ON A SINGLE MACHINE WITH ARBITRARY EARLINESS/TARDINESS PENALTIES AND AN UNRESTRICTED COMMON DUE DATE , 1998 .

[27]  Xiaoqiang Cai,et al.  Scheduling about a common due date with kob-dependent asymmetric earliness and tardiness penalties , 1997 .