A heuristic for adaptive production scheduling and control in flow shop production

Although research in flow shop production scheduling has been carried out for many decades, there is still a gap between theoretical research and industrial applications – especially in some manufacturing paradigms in which adaptive production control is necessary, such as in one-of-a-kind production (OKP). This paper presents an average processing time and lever (APT-LVR) heuristic, integrated with a closed-loop feedback control scheme, to achieve adaptive production scheduling and control in flow shop production. Having been implemented in a local OKP company, our APT-LVR based production scheduling and control system demonstrates a significant potential to improve the company's production efficiency and competitiveness.

[1]  William L. Berry,et al.  Customer‐driven manufacturing , 1995 .

[2]  Hong Wang,et al.  Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions , 2005, Expert Syst. J. Knowl. Eng..

[3]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[4]  Michael J. Shaw,et al.  Adaptive scheduling in dynamic flexible manufacturing systems: a dynamic rule selection approach , 1997, IEEE Trans. Robotics Autom..

[5]  Yiliu Tu,et al.  Adaptive Production Scheduling and Control in One-Of-A-Kind Production , 2012 .

[6]  Deyi Xue,et al.  A framework for generating product production information for mass customization , 2008 .

[7]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[8]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[9]  Reha Uzsoy,et al.  Decomposition Methods for Complex Factory Scheduling Problems , 1996 .

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

[11]  S. G. Deshmukh,et al.  Simulation for analysis of scheduling rules for a flexible manufacturing system , 1995 .

[12]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

[13]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

[14]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[15]  John L. Hunsucker,et al.  A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage , 2004, Eur. J. Oper. Res..

[16]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[17]  A. S. Spachis,et al.  Heuristics for flow-shop scheduling , 1980 .

[18]  Deyi Xue,et al.  An information system for one-of-a-kind production , 2009 .

[19]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

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

[21]  Yiliu Tu.  Automatic scheduling and control of a ship web welding assembly line , 1996 .

[22]  Valerie Botta-Genoulaz,et al.  Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness , 2000 .