A hybrid flowshop scheduling model considering dedicated machines and lot-splitting for the solar cell industry

This paper studies a solar cell industry scheduling problem, which is similar to traditional hybrid flowshop scheduling (HFS). In a typical HFS problem, the allocation of machine resources for each order should be scheduled in advance. However, the challenge in solar cell manufacturing is the number of machines that can be adjusted dynamically to complete the job. An optimal production scheduling model is developed to explore these issues, considering the practical characteristics, such as hybrid flowshop, parallel machine system, dedicated machines, sequence independent job setup times and sequence dependent job setup times. The objective of this model is to minimise the makespan and to decide the processing sequence of the orders/lots in each stage, lot-splitting decisions for the orders and the number of machines used to satisfy the demands in each stage. From the experimental results, lot-splitting has significant effect on shortening the makespan, and the improvement effect is influenced by the processing time and the setup time of orders. Therefore, the threshold point to improve the makespan can be identified. In addition, the model also indicates that more lot-splitting approaches, that is, the flexibility of allocating orders/lots to machines is larger, will result in a better scheduling performance.

[1]  Jianer Chen,et al.  General Multiprocessor Task Scheduling , 1999 .

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

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

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

[5]  Kenneth R. Baker,et al.  A comparative study of lot streaming procedures , 1993 .

[6]  Michael S. Salvador,et al.  A Solution to a Special Class of Flow Shop Scheduling Problems , 1973 .

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

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

[9]  Orhan Engin,et al.  An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems , 2011, Appl. Soft Comput..

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

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

[12]  Minrui Fei,et al.  An efficient quantum immune algorithm to minimize mean flow time for hybrid flow shop problems , 2012, Math. Comput. Simul..

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

[14]  Cengiz Kahraman,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach , 2010, Appl. Soft Comput..

[15]  Abdelhakim Artiba,et al.  A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan , 1998, Eur. J. Oper. Res..

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

[17]  Laxmaiah Manchikanti,et al.  An Invited Review , 1995 .

[18]  Ali Allahverdi,et al.  Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time , 1994 .

[19]  Fantahun M. Defersha,et al.  A comprehensive mathematical model for hybrid flexible flowshop lot streaming problem , 2011 .

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

[21]  Jen-Shiang Chen,et al.  Hybrid tabu search for re-entrant permutation flow-shop scheduling problem , 2008, Expert Syst. Appl..

[22]  M. Michael Umble,et al.  Synchronous Manufacturing: Principles for World Class Excellence , 1995 .

[23]  S.M.T. Fatemi Ghomi,et al.  Hybrid flowshop scheduling with machine and resource-dependent processing times , 2011 .

[24]  Jatinder N. D. Gupta,et al.  A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMES , 2000 .