Adaptive Production Scheduling and Control in One-Of-A-Kind Production
暂无分享,去创建一个
[1] Reha Uzsoy,et al. Decomposition Methods for Complex Factory Scheduling Problems , 1996 .
[2] Michael Pinedo,et al. PRACTICE‐FOCUSED RESEARCH ISSUES FOR SCHEDULING SYSTEMS* , 2002 .
[3] W. Szwarc. Elimination methods in the m × n sequencing problem , 1971 .
[4] David G. Dannenbring,et al. An Evaluation of Flow Shop Sequencing Heuristics , 1977 .
[5] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[6] Richard A. Dudek,et al. Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .
[7] Yih-Long Chang,et al. A new heuristic for the n-job, M-machine flow-shop problem , 1991 .
[8] B. J. Lageweg,et al. A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..
[9] E. Ignall,et al. Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .
[10] 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..
[11] Jatinder N. D. Gupta,et al. Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..
[12] Richard J. Linn,et al. Hybrid flow shop scheduling: a survey , 1999 .
[13] Jiyin Liu,et al. Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling , 1993 .
[14] Chris N. Potts,et al. Permutation vs. non-permutation flow shop schedules , 1991, Oper. Res. Lett..
[15] Jc Johan Wortmann,et al. Customer-driven manufacturing , 1996 .
[16] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[17] Deyi Xue,et al. Adaptive Production Scheduling and Control in One-Of-A-Kind Production , 2012 .
[18] Anurag Agarwal,et al. Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach , 2006, Eur. J. Oper. Res..
[19] É. Taillard. Some efficient heuristic methods for the flow shop sequencing problem , 1990 .
[20] 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..
[21] Michael J. Shaw,et al. Adaptive scheduling in dynamic flexible manufacturing systems: a dynamic rule selection approach , 1997, IEEE Trans. Robotics Autom..
[22] Chester G. Chambers,et al. Manufacturing Operations Manuscripts Published in the First 52 Issues of POM: Review, Trends, and Opportunities , 2009 .
[23] Valerie Botta-Genoulaz,et al. Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness , 2000 .
[24] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[25] Jayant Rajgopal,et al. An extension of Palmer's heuristic for the flow shop scheduling problem , 1988 .
[26] Deyi Xue,et al. A heuristic for adaptive production scheduling and control in flow shop production , 2011 .
[27] David S. Kim,et al. A new method for the placement of buffers in serial production lines , 2009 .
[28] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[29] Jc Johan Wortmann. Production management systems for one-of-a-kind products , 1992 .
[30] Gerhard Friedrich,et al. Mass Customization - Challenges and Solutions , 2006 .
[31] Deyi Xue,et al. A framework for generating product production information for mass customization , 2008 .
[32] S.M.A. Suliman,et al. A two-phase heuristic approach to the permutation flow-shop scheduling problem , 2000 .
[33] Christos Koulamas,et al. A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..
[34] William Karush,et al. Letter to the Editor-A Counterexample to a Proposed Algorithm for Optimal Sequencing of Jobs , 1965 .
[35] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[36] Hong Wang,et al. Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions , 2005, Expert Syst. J. Knowl. Eng..
[37] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[38] Deyi Xue,et al. An information system for one-of-a-kind production , 2009 .
[39] Rubén Ruiz,et al. A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..
[40] Wlodzimierz Szwarc. Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem , 1973, Oper. Res..
[41] S. G. Deshmukh,et al. Simulation for analysis of scheduling rules for a flexible manufacturing system , 1995 .
[42] A. S. Spachis,et al. Heuristics for flow-shop scheduling , 1980 .
[43] Thomas Stützle,et al. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..
[44] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .