Mathematical models and an elephant herding optimization for multiprocessor-task flexible flow shop scheduling problems in the manufacturing resource planning (MRPII) system

Shop floor control (SFC) is one of the main concepts in manufacturing resource planning (MRPII) and production scheduling is a key element in SFC. This paper studies the hybrid flow shop scheduling problem where jobs are multiprocessor. The objective is to minimize total completion time. Although there are several papers considering hybrid flow-shop scheduling problem with multiprocessor tasks, but none propose a mathematical model for this problem. At first, the two problems (fixed and selective cases) are mathematically formulated by mixed integer linear programming models. Using commercial software, the model is used to solve the small instances of the problems. Moreover, an elephant herding optimization is developed to solve large instances of the problems. To numerically evaluate the proposed algorithm, it is compared with two available algorithms in the literature, simulated annealing and shuffled frog-leaping algorithm in the literature.

[1]  S. Deb,et al.  Elephant Herding Optimization , 2015, 2015 3rd International Symposium on Computational and Business Intelligence (ISCBI).

[2]  Klaus Jansen,et al.  General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time , 2005, SIAM J. Comput..

[3]  Funda Sivrikaya-Serifoglu,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach , 2004, J. Oper. Res. Soc..

[4]  Shih-Wei Lin,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach , 2006 .

[5]  Mohamed Haouari,et al.  Improved bounds for hybrid flow shop scheduling with multiprocessor tasks , 2013, Comput. Ind. Eng..

[6]  Reza Tavakkoli-Moghaddam,et al.  Solving a new mathematical model for a hybrid flow shop scheduling problem with a processor assignment by a genetic algorithm , 2012 .

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

[8]  Lotfi Hidri,et al.  Exact and Heuristic Procedures for the Two-Center Hybrid Flow Shop Scheduling Problem With Transportation Times , 2018, IEEE Access.

[9]  Reza Tavakkoli-Moghaddam,et al.  A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times , 2015 .

[10]  Bahman Naderi,et al.  Novel properties along with solution methods for permutation flowshop scheduling , 2016 .

[11]  Orhan Engin,et al.  An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems , 2011, Appl. Soft Comput..

[12]  Khalid Sheikh.  Manufacturing Resource Planning (MRP II) with Introduction to Erp, Scm, and Crm , 2002 .

[13]  Bahman Naderi,et al.  A model and imperialist competitive algorithm for hybrid flow shops with sublots and setup times , 2014 .

[14]  Ching-Jong Liao,et al.  A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks , 2008 .

[15]  Wei Li,et al.  An effective heuristic for no-wait flow shop production to minimize makespan , 2016 .

[16]  Seyyed M. T. Fatemi Ghomi,et al.  Multi-objective fuzzy multiprocessor flowshop scheduling , 2014, Appl. Soft Comput..

[17]  Bahman Naderi,et al.  Hybrid flexible flowshop problems: Models and solution methods , 2014 .

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

[19]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[20]  Ceyda Oguz,et al.  Hybrid flow-shop scheduling problems with multiprocessor task systems , 2004, Eur. J. Oper. Res..

[21]  Cengiz Kahraman,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach , 2010, Appl. Soft Comput..

[22]  M. Dal Cin,et al.  On the diagnosability of self-testing multi-microprocessor systems☆ , 1981 .

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

[24]  Fuh-Der Chou,et al.  A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan , 2011 .

[25]  Shengyao Wang,et al.  An effective shuffled frog-leaping algorithm for hybrid flow-shop scheduling with multiprocessor tasks , 2013 .

[26]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[27]  Jianer Chen,et al.  General Multiprocessor Task Scheduling , 1999 .

[28]  Dragan Vasiljevic,et al.  Handling ties in heuristics for the permutation flow shop scheduling problem , 2015 .