Application of EM algorithm to hybrid flow shop scheduling problems with a special blocking

In this paper, we consider hybrid flow shop (HFS) scheduling problem with a special blocking constraint. Objective function is makespan minimization. HFS and RCb blocking constraint are firstly presented. Then, an integer linear model is presented to find the optimal solution and a lower bound is proposed for high size problems. In order to faster obtain a solution, especially for big size problems, an electromagnetism-like (EM) algorithm is proposed and some mechanisms are introduced to adapt EM-algorithm to HFS scheduling problems. Its performances are compared with optimal solutions when they have been obtained and lower bound for more complex problems. Opportunity to develop and adapt such a meta-heuristic is clearly demonstrated with presented solutions accuracy and time.

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

[2]  Wen-Hung Yang,et al.  AN ELECTROMAGNETISM ALGORITHM OF NEURAL NETWORK ANALYSIS—AN APPLICATION TO TEXTILE RETAIL OPERATION , 2004 .

[3]  Bert De Reyck,et al.  A hybrid scatter search/electromagnetism meta-heuristic for project scheduling , 2006, Eur. J. Oper. Res..

[4]  Nidhal Rezg,et al.  Scheduling Problem of Job-Shop with Blocking: A Taboo Search Approach , 2001 .

[5]  Yazid Mati,et al.  Complexity of flowshop scheduling problems with a new blocking constraint , 2003, Eur. J. Oper. Res..

[6]  Alper Döyen,et al.  A new approach to solve hybrid flow shop scheduling problems by artificial immune system , 2004, Future Gener. Comput. Syst..

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

[8]  George Chryssolouris,et al.  A simulation-based hybrid backwards scheduling framework for manufacturing systems , 2006, Int. J. Comput. Integr. Manuf..

[9]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

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

[11]  Sergio Martinez de La Piedra.  Ordonnancement de systèmes de production avec contraintes de blocage , 2005 .

[12]  Mostafa Zandieh,et al.  A Novel Simulated Annealing Algorithm to Hybrid Flow Shops Scheduling with Sequence-Dependent Setup Times , 2009 .

[13]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[14]  Abdelhakim Artiba,et al.  Scheduling two-stage hybrid flow shop with availability constraints , 2006, Comput. Oper. Res..

[15]  Sergio Martinez,et al.  Heuristics for the two-stages hybrid flowshop with a new blocking constraint , 2004 .

[16]  Chris N. Potts,et al.  Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..

[17]  Nathalie Sauer,et al.  Initial populations tests for genetic algorithm flowshop scheduling problems solving with a special blocking , 2009 .

[18]  Christos Koulamas,et al.  A note on makespan minimization in two-stage flexible flow shops with uniform machines , 2006, Eur. J. Oper. Res..

[19]  Shu-Cherng Fang,et al.  An Electromagnetism-like Mechanism for Global Optimization , 2003, J. Glob. Optim..

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

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