Hybrid Genetic Algorithm for Multicriteria Scheduling with Sequence Dependent Set up Time

In this work, multicriteria decision making objective for flow shop scheduling with sequence dependent set up time and due dates have been developed. Multicriteria decision making objective includes total tardiness, total earliness and makespan simultaneously which is very effective decision making for scheduling jobs in modern manufacturing environment. As problem of flow shop scheduling is NP hard and to solve this in a reasonable time, four Special heuristics (SH) based Hybrid Genetic Algorithm (HGA) have also been developed for proposed multicriteria objective function. A computational analysis upto 200 jobs and 20 machines problems has been conducted to evaluate the performance of four HGA’s. The analysis showed the superiority of SH1 based HGA for small size and SH3 based HGA for large size problem for multicriteria flow shop scheduling with sequence dependent set up time and due dates.

[1]  Alireza Rahimi-Vahed,et al.  A multi-objective particle swarm for a flow shop scheduling problem , 2006, J. Comb. Optim..

[2]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[3]  S. Ponnambalam,et al.  A TSP-GA multi-objective algorithm for flow-shop scheduling , 2004 .

[4]  Frank Werner,et al.  A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size , 1999 .

[5]  Jing Liu,et al.  A survey of scheduling problems with setup times or costs , 2008, Eur. J. Oper. Res..

[6]  Venkata Ranga Neppalli,et al.  Minimizing total flow time in a two-machine flowshop problem with minimum makespan , 2001 .

[7]  Serpil Sayin,et al.  A bicriteria approach to the two-machine flow shop scheduling problem , 1999, Eur. J. Oper. Res..

[8]  Mostafa Zandieh,et al.  Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness , 2009 .

[9]  Manoj Kumar Tiwari,et al.  New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs , 2010, Eur. J. Oper. Res..

[10]  Suna Kondakci Köksalan,et al.  Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan , 2004, Eur. J. Oper. Res..

[11]  Chandrasekharan Rajendran,et al.  Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date , 2001, Eur. J. Oper. Res..

[12]  Taïcir Loukil,et al.  Solving multi-objective production scheduling problems using metaheuristics , 2005, Eur. J. Oper. Res..

[13]  D. Ravindran,et al.  Flow shop scheduling with multiple objective of minimizing makespan and total flow time , 2005 .

[14]  A. G. Lockett,et al.  Technical Note - A Scheduling Problem Involving Sequence Dependent Changeover Times , 1972, Oper. Res..

[15]  F. Fred Choobineh,et al.  A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times , 2006, Eur. J. Oper. Res..

[16]  C. Rajendran.  Heuristics for scheduling in flowshop with multiple objectives , 1995 .

[17]  Tamer Eren,et al.  A bicriteria m-machine flowshop scheduling with sequence-dependent setup times , 2010 .

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

[19]  Malgorzata Sterna,et al.  A comparison of solution procedures for two-machine flow shop scheduling with late work criterion , 2005, Comput. Ind. Eng..