Adaptive Production Scheduling and Control in One-Of-A-Kind Production

Even though research in flow shop production scheduling has been carried out for many decades, there is still a gap between research and application-especially in manufacturing paradigms such as one-of-a-kind production (OKP) that intensely challenges real time adaptive production scheduling and control. Indeed, many of the most popular heuristics continue to use Johnson's algorithm (1954) as their core. This paper presents a state space (SS) heuristic, integrated with a closed-loop feedback control structure, to achieve adaptive production scheduling and control in OKP. Our SS heuristic, because of its simplicity and computational efficiency, has the potential to become a core heuristic. Through a series of case studies, including an industrial implementation in OKP, our SS-based production scheduling and control system demonstrates significant potential to improve production efficiency.

[1]  Deyi Xue,et al.  Prediction of manufacturing resource requirements from customer demands in mass-customisation production , 2009 .

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

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

[4]  Richard D. Smith,et al.  A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop , 1967, Oper. Res..

[5]  Deyi Xue,et al.  A heuristic for adaptive production scheduling and control in flow shop production , 2011 .

[6]  David S. Kim,et al.  A new method for the placement of buffers in serial production lines , 2009 .

[7]  Anurag Agarwal,et al.  Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach , 2006, Eur. J. Oper. Res..

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

[9]  Jc Johan Wortmann.  Production management systems for one-of-a-kind products , 1992 .

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

[11]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

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

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

[14]  Jayant Rajgopal,et al.  An extension of Palmer's heuristic for the flow shop scheduling problem , 1988 .

[15]  Jiyin Liu,et al.  Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling , 1993 .

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

[17]  W. Szwarc.  Elimination methods in the m × n sequencing problem , 1971 .

[18]  Chris N. Potts,et al.  Permutation vs. non-permutation flow shop schedules , 1991, Oper. Res. Lett..

[19]  Erik Demeulemeester,et al.  Resource-constrained project scheduling: A survey of recent developments , 1998, Comput. Oper. Res..

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

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

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

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

[24]  Gerhard Friedrich,et al.  Mass Customization - Challenges and Solutions , 2006 .

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

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

[27]  Michael Pinedo,et al.  PRACTICE‐FOCUSED RESEARCH ISSUES FOR SCHEDULING SYSTEMS* , 2002 .

[28]  S.M.A. Suliman,et al.  A two-phase heuristic approach to the permutation flow-shop scheduling problem , 2000 .

[29]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

[30]  Chester G. Chambers,et al.  Manufacturing Operations Manuscripts Published in the First 52 Issues of POM: Review, Trends, and Opportunities , 2009 .

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

[32]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

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

[34]  Richard A. Dudek,et al.  Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .

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

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

[37]  Christos Koulamas,et al.  A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..

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

[39]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

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

[41]  Wlodzimierz Szwarc.  Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem , 1973, Oper. Res..

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

[43]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

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

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

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

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

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