A case study of a hybrid flow shop with no-wait and limited idle time to minimize material waste

This paper deals with a new configuration of scheduling problem inspired from a real industrial case which is pasta production. It could be defined as maximal-idle time (limited idle time) and no-wait hybrid flow shop with dedicated machines. Machines on the first stage have a limited idle time interval constraint. To the best of our knowledge, this is the first paper to study constraint of maximal idle time simultaneously with machine set-up for hybrid flow shop problems. The objective is to minimize waste of materials due to machine idle time exceeding α unit. Two mixed integer linear programming models (MIP) with two different objectives are proposed. Using numerical experiments, we compare the results of the first MIP according to makespan minimization and waste minimization.

[1]  Bahman Naderi,et al.  Modeling and scheduling no-idle hybrid flow shop problems , 2016 .

[2]  M. F. Tasgetiren,et al.  A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion , 2011 .

[3]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[4]  J. Kamburowski,et al.  On the NEH heuristic for minimizing the makespan in permutation flow shops , 2007 .

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

[6]  Quan-Ke Pan,et al.  A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion , 2013 .

[7]  Jerzy Kamburowski,et al.  A heuristic for minimizing the makespan in no-idle permutation flow shops , 2005, Comput. Ind. Eng..

[8]  D. Pohoryles,et al.  Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .

[9]  Quan-Ke Pan,et al.  An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem , 2014 .

[10]  Dechang Pi,et al.  Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion , 2017, Appl. Soft Comput..

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

[12]  Sergey Sevastyanov,et al.  The flow shop problem with no-idle constraints: A review and approximation , 2009, Eur. J. Oper. Res..

[13]  Alain Guinet,et al.  A travelling salesman approach to solve the F , 2005, Eur. J. Oper. Res..

[14]  Gur Mosheiov,et al.  A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time , 2008, Eur. J. Oper. Res..

[15]  Odile Bellenguez-Morineau,et al.  Scheduling a two-stage hybrid flow shop with dedicated machines, time lags and sequence-dependent family setup times , 2016, 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[16]  Xingsheng Gu,et al.  A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion , 2012, Comput. Oper. Res..