Scheduling a tempered glass manufacturing system: a three-stage hybrid flow shop model

Chinese tempered glass has entered a fast and stable growing era. To improve the productivity of tempered glass manufacturers, this paper investigates a scheduling problem in tempered glass production system, originated from a tempered glass manufacturer in China. This problem can be formulated as a three-stage hybrid flow shop (HFS). Single and batch processing machines coexist in this HFS. Besides, a limited buffer, between the first two stages, and machine eligibility requirement are also significant characteristics. To address this complicated scheduling problem, we first establish an integer programming model with the objective of minimising the makespan, i.e. the maximum completion time of jobs in the system. Due to the strong NP-hard nature of the problem, we then propose a constructive heuristic method, a genetic algorithm, as well as a simulated annealing algorithm, to solve practical large-scale problems. Computational results demonstrate the efficiency of the proposed approaches.

[1]  Mohammad Reza Amin-Naseri,et al.  Hybrid flow shop scheduling with parallel batching , 2009 .

[2]  Ching-Jong Liao,et al.  An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem , 2012, Appl. Soft Comput..

[3]  Ling Wang,et al.  An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers , 2008, Comput. Oper. Res..

[4]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[5]  Quan-Ke Pan,et al.  Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm , 2015, Inf. Sci..

[6]  Fariborz Jolai,et al.  Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem , 2013 .

[7]  Ming Liu,et al.  A heuristic method for two-stage hybrid flow shop with dedicated machines , 2013, Comput. Oper. Res..

[8]  Deming Lei,et al.  A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents , 2015, Expert Syst. Appl..

[9]  Magdalene Marinaki.  Flow Shop Scheduling Problem , 2009, Encyclopedia of Optimization.

[10]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers , 2009, Comput. Oper. Res..

[11]  Dong-Ho Lee,et al.  Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops , 2009, Comput. Ind. Eng..

[12]  Reza Tavakkoli-Moghaddam,et al.  A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations , 2014 .

[13]  Xianwen Meng,et al.  A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines , 2015, J. Intell. Manuf..

[14]  Hui Luo,et al.  An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop , 2015, Inf. Process. Lett..

[15]  Ching-Jong Liao,et al.  Two new approaches for a two-stage hybrid flowshop problem with a single batch processing machine under waiting time constraint , 2017, Comput. Ind. Eng..

[16]  Pei-Chann Chang,et al.  Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry , 2007, Appl. Soft Comput..

[17]  David E. Goldberg,et al.  Genetic algorithms and Machine Learning , 1988, Machine Learning.

[18]  Dritan Nace,et al.  Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage , 2012, Comput. Oper. Res..

[19]  G. M. Komaki,et al.  Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems , 2016 .

[20]  Rasaratnam Logendran,et al.  Hybrid flow shop batching and scheduling with a bi-criteria objective , 2016 .

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

[22]  M. Zandieh,et al.  Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers , 2012 .

[23]  Tao Wang,et al.  An effective neighborhood search algorithm for scheduling a flow shop of batch processing machines , 2011, Comput. Ind. Eng..

[24]  Javad Rezaeian,et al.  Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach of artificial immune system , 2015, Appl. Soft Comput..

[25]  Joseph LaDou,et al.  Printed circuit board industry. , 2006, International journal of hygiene and environmental health.

[26]  Min Liu,et al.  A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry , 2015, Comput. Ind. Eng..

[27]  Rasaratnam Logendran,et al.  An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes , 2017, Comput. Oper. Res..

[28]  Deming Lei,et al.  Two-phase neighborhood search algorithm for two-agent hybrid flow shop scheduling problem , 2015, Appl. Soft Comput..

[29]  Behdin Vahedi-Nouri,et al.  Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints , 2013 .

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

[31]  George L. Vairaktarakis,et al.  The Hybrid Flow Shop , 2013 .

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

[33]  Ying Liu,et al.  An effective hybrid particle swarm optimization for batch scheduling of polypropylene processes , 2010, Comput. Chem. Eng..

[34]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[35]  H. Mohammadi,et al.  Bi-objective simulated annealing and adaptive memory procedure approaches to solve a hybrid flow shop scheduling problem with unrelated parallel machines , 2012, 2012 IEEE International Conference on Industrial Engineering and Engineering Management.

[36]  J. N. D. Gupta,et al.  Minimizing tardy jobs in a two-stage hybrid flowshop , 1998 .

[37]  Antonio Costa,et al.  A novel genetic algorithm for the hybrid flow shop scheduling with parallel batching and eligibility constraints , 2014 .

[38]  Michel Minoux,et al.  A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints , 2012, Comput. Oper. Res..

[39]  Shanling Li,et al.  A hybrid two-stage flowshop with part family, batch production, major and minor set-ups , 1997 .

[40]  Yahya Fathi,et al.  Abstract Discrete Optimization , 2000 .

[41]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[42]  Taho Yang,et al.  Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints , 2012, J. Intell. Manuf..

[43]  Quan-Ke Pan,et al.  A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem , 2014, Appl. Soft Comput..

[44]  Ghasem Moslehi,et al.  A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion , 2014, Comput. Oper. Res..

[45]  Behrooz Karimi,et al.  Cyclic hybrid flow shop scheduling problem with limited buffers and machine eligibility constraints , 2015 .

[46]  Gur Mosheiov,et al.  A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines , 2013 .

[47]  Atabak Elmi,et al.  A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots , 2013, Comput. Oper. Res..

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