A variable neighbourhood search for hybrid flow-shop scheduling problem with rework and set-up times

This paper deals with hybrid flow-shop scheduling problem with rework. In this problem, jobs are inspected at the last stage, and poorly processed jobs were returned and processed again. Thus, a job may visit a stage more than once, and we have a hybrid flow-shop with re-entrant flow. This kind of a shop may occur in many industries, such as final inspection system in automotive manufacturing. The criterion is to minimize the makespan of the system. We developed a 0–1 mixed-integer program of the problem. Since the hybrid flow-shop scheduling problem is NP-hard, an algorithm for finding an optimal solution in polynomial time does not exist. So we generalized some heuristic methods based on several basic dispatching rules and proposed a variable neighbourhood search (VNS) for the problem with sequence-dependent set-up times and unrelated parallel machines. The computational experiments show that VNS provides better solutions than heuristic methods.

[1]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[2]  S.-W. Choi,et al.  Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop , 2003 .

[3]  Seyyed M. T. Fatemi Ghomi,et al.  Two stage reentrant hybrid flow shop with setup times and the criterion of minimizing makespan , 2011, Appl. Soft Comput..

[4]  Pandian Vasant,et al.  Hybrid pattern search and simulated annealing for fuzzy production planning problems , 2010, Comput. Math. Appl..

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[7]  Jen-Shiang Chen,et al.  Solving the Reentrant Permutation Flow-Shop Scheduling Problem with a Hybrid Genetic Algorithm , 2013 .

[8]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

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

[10]  J.-S. Chen,et al.  Minimizing makespan in re-entrant permutation flow-shops , 2003, J. Oper. Res. Soc..

[11]  Simme Douwe P. Flapper,et al.  Logistic planning of rework with deteriorating work-in-process , 2004 .

[12]  Dong-Ho Lee,et al.  Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates , 2009 .

[13]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[14]  Pierre Hansen,et al.  Solving large p-median clustering problems by primal–dual variable neighborhood search , 2009, Data Mining and Knowledge Discovery.

[15]  Paveena Chaovalitwongse,et al.  Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria , 2008 .

[16]  Maw-Sheng Chern,et al.  Multi-family scheduling in a two-machine reentrant flow shop with setups , 2008, Eur. J. Oper. Res..

[17]  Pandian Vasant,et al.  HYBRID SIMULATED ANNEALING AND GENETIC ALGORITHMS FOR INDUSTRIAL PRODUCTION MANAGEMENT PROBLEMS , 2009 .

[18]  Pandian Vasant,et al.  Hybrid LS-SA-PS methods for solving fuzzy non-linear programming problems , 2013, Math. Comput. Model..

[19]  John Ma,et al.  Discrete event simulation in automotive final process system , 2002, Proceedings of the Winter Simulation Conference.

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

[21]  Ronald G. Askin,et al.  Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..

[22]  Dong-Ho Lee,et al.  Real-time scheduling for reentrant hybrid flow shops: A decision tree based mechanism and its application to a TFT-LCD line , 2011, Expert Syst. Appl..

[23]  F. Yalaoui,et al.  Fuzzy Lorenz Ant Colony System to solve multiobjective reentrant hybride flowshop scheduling problem , 2011, 2011 International Conference on Communications, Computing and Control Applications (CCCA).

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

[25]  J. Wesley Barnes,et al.  Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches , 2005, Eur. J. Oper. Res..

[26]  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..

[27]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[28]  Mostafa Zandieh,et al.  Scheduling of a no-wait two-machine flow shop with sequence-dependent setup times and probable rework using robust meta-heuristics , 2012 .

[29]  Mostafa Zandieh,et al.  Modeling and scheduling a case of flexible flowshops: Total weighted tardiness minimization , 2009, Comput. Ind. Eng..

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

[31]  John L. Hunsucker,et al.  An evaluation of sequencing heuristics in flow shops with multiple processors , 1996 .

[32]  Abdelhakim Artiba,et al.  Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints , 2004, Comput. Ind. Eng..