Lot splitting scheduling procedure for makespan reduction and machine capacity increase in a hybrid flow shop with batch production

The general definition of the hybrid flow shop (HFS) environment is a set of S ≥ 2 production stages where at least one of these stages includes more than one machine, which can process one job at a time. A job can be defined as several operations to be performed by none, one, or more machines at each stage. Usually, these jobs are completed in some sequence between the different production stages, and in the case of setup activities, products are grouped in batches with buffers of work in progress between different production stages. Today, flexible production systems permit in some instances to relax job precedence constrains with alternative process cycles and to group together different batches of similar products in order to reduce setup activity incidence. On the other hand, the availability of multiple parallel machines in a single production stage makes it possible to split the lot size between different resources. This paper aims to solve the HFS scheduling problem in a flexible multistage batch production system, offering a heuristic procedure, to minimize the production makespan and increase the productive capacity utilization using a batch aggregation/splitting strategy while introducing the “workload leveling function” concept. The results are compared with other important scheduling rules widely accepted in the industry and made part of an industrial application. The company used as a test sample is an Italian rotor shaft manufacturer. The final result is illustrated to validate the proposed heuristics.

[1]  Yu Liu,et al.  Scheduling multistage batch plants with parallel units and no interstage storage , 2008, Comput. Chem. Eng..

[2]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[3]  Tadeusz Sawik,et al.  A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing , 2007, Eur. J. Oper. Res..

[4]  V. Vinod,et al.  Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental study , 2008 .

[5]  Hua Xuan,et al.  Scheduling a hybrid flowshop with batch production at the last stage , 2007, Comput. Oper. Res..

[6]  Taho Yang,et al.  A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem , 2007, Eur. J. Oper. Res..

[7]  Yueh-Min Huang,et al.  Combined column generation and constructive heuristic for a proportionate flexible flow shop scheduling , 2008 .

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

[9]  Cem Canel,et al.  An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system , 2005 .

[10]  Ahmet Bolat,et al.  Flow-shop scheduling for three serial stations with the last two duplicate , 2005, Comput. Oper. Res..

[11]  Tadeusz Sawik,et al.  Hierarchical approach to production scheduling in make-to-order assembly , 2006 .

[12]  Bertrand M. T. Lin,et al.  Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs , 2004 .

[13]  Pierre N. Robillard,et al.  Scheduling with earliest start and due date constraints on multiple machines , 1975 .

[14]  Basheer M. Khumawala,et al.  A comparison of sequencing rules in static and dynamic hybrid flow systems , 1997 .

[15]  Rubén Ruiz,et al.  Modeling realistic hybrid flexible flowshop scheduling problems , 2008, Comput. Oper. Res..

[16]  Rasaratnam Logendran,et al.  Sequence-dependent group scheduling problems in flexible flow shops , 2006 .

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

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

[19]  Lifeng Xi,et al.  A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal , 2007, Eur. J. Oper. Res..

[20]  Geun-Cheol Lee,et al.  Estimating order lead times in hybrid flowshops with different scheduling rules , 2009, Comput. Ind. Eng..

[21]  Jean-Charles Billaut,et al.  Total completion time minimization in a computer system with a server and two parallel processors , 2005, Comput. Oper. Res..

[22]  Shen-Ming Lee,et al.  Transfer batch scheduling for a two-stage flowshop with identical parallel machines at each stage , 1997 .

[23]  Rasaratnam Logendran,et al.  Group scheduling in flexible flow shops , 2005 .

[24]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[25]  Mostafa Zandieh,et al.  Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness , 2009 .

[26]  L. P. Khoo,et al.  An immune algorithm approach to the scheduling of a flexible PCB flow shop , 2003 .

[27]  Mohamed Haouari,et al.  Optimal Scheduling of a Two-stage Hybrid Flow Shop , 2006, Math. Methods Oper. Res..

[28]  T. Yang *,et al.  Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study , 2004 .

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

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

[31]  Stefan Voß,et al.  Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application , 2007 .

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

[33]  Maurizio Faccio,et al.  Balancing–sequencing procedure for a mixed model assembly system in case of finite buffer capacity , 2009 .

[34]  Chris N. Potts,et al.  Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..

[35]  Wei Zhang,et al.  Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops , 2005 .

[36]  Orhan Engin,et al.  Using ant colony optimization to solve hybrid flow shop scheduling problems , 2007 .

[37]  Frank Werner,et al.  A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria , 2009, Comput. Oper. Res..

[38]  Fariborz Jolai,et al.  A variable neighborhood search for job shop scheduling with set-up times to minimize makespan , 2009, Future Gener. Comput. Syst..