Solving a new mathematical model for a hybrid flow shop scheduling problem with a processor assignment by a genetic algorithm

This paper presents a new mathematical model for a hybrid flow shop scheduling problem with a processor assignment that minimizes makespan (i.e., Cmax) and cost of assigning a number of processors to stages. In this problem, it is assumed that there are a number of parallel identical processors which are assigned to all of the stages with an unlimited intermediate storage between any two successive stages. To solve such a hard problem, first a new heuristic algorithm is proposed to compute the makespan that is embedded in the proposed genetic algorithm in order to find the best sequence of jobs, and then processors are assigned to the stages simultaneously. A number of test problems have been solved and related results are illustrated and analyzed.

[1]  Rubén Ruiz,et al.  Modeling realistic hybrid flexible flowshop scheduling problems , 2008, Comput. Oper. Res..

[2]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers , 2000 .

[3]  A. Guinet,et al.  Textile Production Systems: a Succession of Non-identical Parallel Processor Shops , 1991 .

[4]  Dong Cao,et al.  Parallel machine selection and job scheduling to minimize machine cost and job tardiness , 2005, Comput. Oper. Res..

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

[6]  Orhan Engin,et al.  Using ant colony optimization to solve hybrid flow shop scheduling problems , 2007 .

[7]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[8]  Andrei Tchernykh,et al.  Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers , 2009, Comput. Ind. Eng..

[9]  D. E. Deal,et al.  FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors , 1995 .

[10]  Saul I. Gass,et al.  Erratum to "Cycling in linear programming problems" [Computers and Operations Research 31 (2002) 303-311] , 2006, Comput. Oper. Res..

[11]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[12]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[13]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.

[14]  Carlos Andrés,et al.  Group technology in a hybrid flowshop environment: A case study , 2005, Eur. J. Oper. Res..

[15]  Ceyda Oguz,et al.  A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks , 2005, J. Sched..

[16]  Yueh-Min Huang,et al.  Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm , 2008, Expert Syst. Appl..

[17]  Jose M. Framiñan,et al.  Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective , 2010, Comput. Oper. Res..

[18]  Frank Werner,et al.  A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria , 2009, Comput. Oper. Res..

[19]  Marius M. Solomon,et al.  A computational study of heuristics for two-stage flexible flowshops , 1996 .

[20]  D. Santos,et al.  Global lower bounds for flow shops with multiple processors , 1995 .

[21]  Ceyda Oguz,et al.  Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion , 2007 .

[22]  Reza Tavakkoli-Moghaddam,et al.  A memetic algorithm for the flexible flow line scheduling problem with processor blocking , 2009, Comput. Oper. Res..

[23]  Yueh-Min Huang,et al.  A hybrid two-phase encoding particle swarm optimization for total weighted completion time minimization in proportionate flexible flow shop scheduling , 2012 .

[24]  Gupta J.N.D..  TWO-STAGE HYBRID FLOW SHOP SCHEDULING PROBLEM , 1988 .

[25]  Ronald G. Askin,et al.  Comparing scheduling rules for flexible flow lines , 2003 .

[26]  Mostafa Zandieh,et al.  An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines , 2010 .

[27]  Jean-Charles Billaut,et al.  Production , Manufacturing and Logistics A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation , 2004 .

[28]  Tamás Kis,et al.  A review of exact solution methods for the non-preemptive multiprocessor flowshop problem , 2005, Eur. J. Oper. Res..

[29]  Jairo R. Montoya-Torres,et al.  Scheduling jobs on a k-stage flexible flow-shop , 2004, Proceedings of the 2004 IEEE Systems and Information Engineering Design Symposium, 2004..

[30]  Fariborz Jolai,et al.  A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection , 2009 .

[31]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[32]  T. Sawik.  An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers , 2002 .

[33]  Jean-Charles Billaut,et al.  Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art , 1999, RAIRO Oper. Res..