A decomposition approach for the car resequencing problem with selectivity banks

DOI10.1016/j.cor.2012.05.012zbMath1349.90276OpenAlexW1996453680MaRDI QIDQ339550

Michael Zenker, Nils Boysen

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.05.012

zbMATH Keywords

ant colony optimizationgraph searchmixed-model assembly linecar sequencingresequencingselectivity bank

Mathematics Subject Classification ID

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

Related Items (3)

The parallel stack loading problem to minimize blockages ⋮ Integrated real-time control of mixed-model assembly lines and their part feeding processes ⋮ Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of the car sequencing problem.
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Solving the car sequencing problem via branch \& bound
• Sequencing mixed-model assembly lines: survey, classification and model critique
• Heuristics and exact algorithms for solving the Monden problem
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• Iterative beam search for car sequencing
• Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
• Solving real car sequencing problems with ant colony optimization
• Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints
• A sequential ordering problem in automotive paint shops
• Searching optimal resequencing and feature assignment on an automated assembly line

This page was built for publication: A decomposition approach for the car resequencing problem with selectivity banks