Some heuristics for the hybrid flow shop scheduling problem with setup and assembly operations

Article history: Received January 2 2013 Received in revised format March 14 2013 Accepted March 14 2013 Available online March 15 2013 This paper presents a two-stage hybrid flow shop scheduling problem with setup and assembly operations. The proposed study of this paper considers one kind of product with a quantity of demand where each product is made by assembling a set of different parts. At first, the parts are manufactured in a two-stage hybrid flow-shop and then the parts are assembled into products on assembly stage. Setup operations are needed when a machine starts processing the parts or it changes items. The considered objective is minimizing the completion time of all products. Since the problem is classified as NP-hard class, a combinatorial algorithm is proposed. The proposed algorithm is a three-step procedure where we use heuristic, genetic algorithm (GA), simulated annealing (SA), NEH and Johnson’s algorithm. Three lower bounds are presented and improved to evaluate the proposed algorithms. An extensive computational experiment is conducted to compare the performances of the proposed algorithms. © 2013 Growing Science Ltd. All rights reserved

[1]  T. P. Bagchi,et al.  Lot streaming and scheduling heuristics for m -machine no-wait flowshops , 2000 .

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

[3]  Jacek Blazewicz,et al.  Handbook on Scheduling: From Theory to Applications , 2014 .

[4]  Abdelaziz Hamzaoui,et al.  A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop , 2010, Eng. Appl. Artif. Intell..

[5]  N. Jawahar,et al.  Evolutionary algorithms for scheduling m-machine flow shop with lot streaming , 2008 .

[6]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

[7]  Heinrich Kuhn,et al.  A taxonomy of flexible flow line scheduling procedures , 2007, Eur. J. Oper. Res..

[8]  Xi Sun,et al.  Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling , 2003, Eur. J. Oper. Res..

[9]  Jaehwan Yang,et al.  A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines , 2010 .

[10]  Ulrike Schneider.  A tabu search tutorial based on a real-world scheduling problem , 2011, Central Eur. J. Oper. Res..

[11]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[12]  T. Cheng,et al.  Scheduling the fabrication and assembly of components in a two-machine flowshop , 1999 .

[13]  Zhihong Jin,et al.  Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem , 2006 .

[14]  Rico Walter.  Comparing the minimum completion times of two longest-first scheduling-heuristics , 2013, Central Eur. J. Oper. Res..

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

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

[17]  C. Sung,et al.  A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times , 2008 .

[18]  Fawaz S. Al-Anzi,et al.  The two-stage assembly scheduling problem to minimize total completion time with setup times , 2009, Comput. Oper. Res..

[19]  Peter Köchel,et al.  Job scheduling with forbidden setups and two objectives using genetic algorithms and penalties , 2011, Central Eur. J. Oper. Res..

[20]  Reza Tavakkoli-Moghaddam,et al.  A two-phase fuzzy programming model for a complex bi-objective no-wait flow shop scheduling , 2012 .

[21]  C. Potts,et al.  A branch and bound algorithm for the two-stage assembly scheduling problem , 1997 .

[22]  Christos Koulamas,et al.  The three-stage assembly flowshop scheduling problem , 2001, Comput. Oper. Res..

[23]  Masao Yokoyama,et al.  Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times , 2005, Eur. J. Oper. Res..

[24]  L.K. Gaafar *,et al.  Genetic algorithms and simulated annealing for scheduling in agile manufacturing , 2005 .

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

[26]  Zoltán Kovács,et al.  Heuristic algorithms for a complex parallel machine scheduling problem , 2008, Central Eur. J. Oper. Res..

[27]  Vittorio Maniezzo,et al.  Matheuristics: Hybridizing Metaheuristics and Mathematical Programming , 2009 .

[28]  Sukran N. Kadipasaoglu.  A note on scheduling hybrid flow systems , 1997 .

[29]  Fariborz Jolai,et al.  A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem , 2013 .

[30]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

[31]  Ripon Kumar Chakrabortty,et al.  Solving an aggregate production planning problem by using multi-objective genetic algorithm (MOGA) approach , 2013 .

[32]  Ali Allahverdi,et al.  Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan , 2009, Comput. Oper. Res..

[33]  George Q. Huang,et al.  Hybrid flowshop scheduling with batch-discrete processors and machine maintenance in time windows , 2011 .

[34]  Masao Yokoyama,et al.  Hybrid flow-shop scheduling with assembly operations , 2001 .

[35]  Chandramouli Anandaraman.  An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems , 2011 .

[36]  Masao Yokoyama,et al.  Flow-shop scheduling with setup and assembly operations , 2008, Eur. J. Oper. Res..

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