Sequencing Mixed-Model Assembly Lines with Limited Intermediate Buffers by a GA/SA-Based Algorithm

DOI10.1007/978-3-540-85930-7_3zbMath1173.90395OpenAlexW1574697415MaRDI QIDQ3602003

Meng-Chang Wang, Yun-Qing Rao, Binggang Wang, Xinyu Shao

Publication date: 12 February 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85930-7_3

zbMATH Keywords

genetic algorithmsmixed-model assembly lineslimited intermediate buffers

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Cites Work

• Multi-criteria sequencing problem for a mixed-model assembly line in a JIT production system
• Using beam search techniques for sequencing mixed-model assembly lines
• A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines.
• The permutation flow shop with buffers: A tabu search approach
• Sequencing mixed-model assembly lines to level parts usage and minimize line length

This page was built for publication: Sequencing Mixed-Model Assembly Lines with Limited Intermediate Buffers by a GA/SA-Based Algorithm