A heuristic procedure for the automobile assembly-line sequencing problem considering multiple product options
作者： F.-Y. Ding , J. He
DOI: 10.1080/00207540701381291
关键词: Product (mathematics) 、 Constructive 、 Mathematical optimization 、 Engineering 、 Simulated annealing 、 Engineering drawing 、 Blocking (computing) 、 Smoothing 、 Assembly line 、 Sequence 、 Automotive industry
摘要: Mixed-model assembly nowadays is a common practice in the automobile industry. In an plant, many car options often need to be considered sequencing line, for example, multiple objectives that consider pattern, blocking, spacing, and smoothing of options. A general heuristic procedure developed this paper lines considering The obtains initial sequence by enhanced constructive procedure, swaps orders most deteriorating category objectives, performs re-sequencing attempting improve swapped sequence. was shown frequently sequences swapping when opportunities exist. further improvement step also proposed perform limited search based on solution. limited-search effective improving solutions from i...
sci-hub.se 参考文章(34)
Edward P. K. Tsang, Andrew J. Davenport, Solving constraint satisfaction sequencing problems by iterative repair ,(2001)
Matthias Prandtstetter, Günther R. Raidl, A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search. ,(2005)
Michael E. Bergen, Peter van Beek, Tom Carchrae, Constraint-Based Vehicle Assembly Line Sequencing Lecture Notes in Computer Science. pp. 88- 99 ,(2001) , 10.1007/3-540-45153-6_9
Markus Puchta, Jens Gottlieb, Solving Car Sequencing Problems by Local Optimization Lecture Notes in Computer Science. pp. 132- 142 ,(2002) , 10.1007/3-540-46004-7_14
G.J. Miltenburg, T. Goldstein, Developing production schedules which balance part usage and smooth production loads for just‐in‐time production systems Naval Research Logistics. ,vol. 38, pp. 893- 910 ,(1991) , 10.1002/NAV.3800380608
P. Fouda, J. Danloy, T. L'Eglise, P. De Lit, B. Rekiek, A. Delchambre, A heuristic to generate a precedence graph between components for a product family Proceedings of the 2001 IEEE International Symposium on Assembly and Task Planning (ISATP2001). Assembly and Disassembly in the Twenty-first Century. (Cat. No.01TH8560). pp. 43- 48 ,(2001) , 10.1109/ISATP.2001.928964
R.W. Eglese, Simulated annealing: A tool for operational research European Journal of Operational Research. ,vol. 46, pp. 271- 281 ,(1990) , 10.1016/0377-2217(90)90001-R
Zhao Xiaobo, Katsuhisa Ohno, A sequencing problem for a mixed-model assembly line in a JIT production system annual conference on computers. ,vol. 27, pp. 71- 74 ,(1994) , 10.1016/0360-8352(94)90240-2
Caroline Gagné, Marc Gravel, Wilson L. Price, Solving real car sequencing problems with ant colony optimization European Journal of Operational Research. ,vol. 174, pp. 1427- 1448 ,(2006) , 10.1016/J.EJOR.2005.02.063
M Gravel, C Gagné, W L Price, Review and comparison of three methods for the solution of the car sequencing problem Journal of the Operational Research Society. ,vol. 56, pp. 1287- 1295 ,(2005) , 10.1057/PALGRAVE.JORS.2601955