Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm

In this paper, we considered the flow shop scheduling problem with respect to the both objectives of the makespan and the mean continuous running time, proposed a security based bi-objective flow shop scheduling model. To solve the proposed model more effectively, we presented a hybrid genetic algorithm (HGA), which used some tailor made genetic operators and a local search operator in order to improve the local search ability of GA. The proposed algorithm is tested with some well-known problems in literature. The computational results demonstrated the effectiveness of the proposed algorithm.

[1]  Lionel Amodeo,et al.  New multi-objective method to solve reentrant hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[2]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[3]  Deming Lei,et al.  A Pareto archive particle swarm optimization for multi-objective job shop scheduling , 2008, Comput. Ind. Eng..

[4]  C. Rajendran,et al.  A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs , 2006 .

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

[6]  Yuping Wang,et al.  An Improved Genetic Algorithm for Job Shop Scheduling Problem , 2010, 2010 International Conference on Computational Intelligence and Security.

[7]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[8]  Li-Chen Fu,et al.  NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems , 2011, Expert Syst. Appl..

[9]  Ling Wang,et al.  A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[10]  Mostafa Zandieh,et al.  An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness , 2009, Expert Syst. Appl..

[11]  Reza Tavakkoli-Moghaddam,et al.  A multi-objective electromagnetism algorithm for a bi-objective flowshop scheduling problem , 2012 .

[12]  Yuping Wang,et al.  A new hybrid genetic algorithm for job shop scheduling problem , 2012, Comput. Oper. Res..

[13]  Pei-Chann Chang,et al.  Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems , 2007, Expert Syst. Appl..

[14]  Nicolas Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

[15]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[16]  Tamer Eren,et al.  A bicriteria scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[17]  Clarisse Dhaenens,et al.  An exact parallel method for a bi-objective permutation flowshop problem , 2007, Eur. J. Oper. Res..

[18]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[19]  Ching-Jong Liao,et al.  A discrete particle swarm optimization for lot-streaming flowshop scheduling problem , 2008, Eur. J. Oper. Res..

[20]  Thomas Stützle,et al.  A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems , 2011, Comput. Oper. Res..

[21]  Mostafa Zandieh,et al.  Bi-objective group scheduling in hybrid flexible flowshop: A multi-phase approach , 2010, Expert Syst. Appl..

[22]  Martin Josef Geiger,et al.  Decision support for multi-objective flow shop scheduling by the Pareto Iterated Local Search methodology , 2011, Comput. Ind. Eng..

[23]  Kagan Gokbayrak,et al.  Service Time Optimization of Mixed-Line Flow Shop Systems , 2010, IEEE Transactions on Automatic Control.

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

[25]  Suk Joo Bae,et al.  Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm , 2011, Comput. Ind. Eng..

[26]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[27]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[28]  Michel Minoux,et al.  A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints , 2012, Comput. Oper. Res..