A decomposition approach for the car resequencing problem with selectivity banks

DOI10.1016/J.COR.2012.05.012zbMATH Open1349.90276OpenAlexW1996453680MaRDI QIDQ339550FDOQ339550

Authors: Nils Boysen, Michael Zenker 

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

Recommendations

• Analysis and design of sequencing rules for car sequencing
• Solving the car sequencing problem via branch \& bound
• Car sequencing versus mixed-model sequencing: a computational study
• Algorithms for the car sequencing and the level scheduling problem
• Review and comparison of three methods for the solution of the car sequencing problem

zbMATH Keywords

ant colony optimizationgraph searchcar sequencingmixed-model assembly lineresequencingselectivity bank

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• Sequencing mixed-model assembly lines: survey, classification and model critique
• Heuristics and exact algorithms for solving the Monden problem
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• 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
• Title not available (Why is that?)
• On the complexity of the car sequencing problem.
• Solving the car sequencing problem via branch \& bound

Cited In (6)

• Improvement of earliness and lateness by postponement on an automotive production line
• Integrated real-time control of mixed-model assembly lines and their part feeding processes
• Resequencing with parallel queues to minimize the maximum number of items in the overflow area
• The parallel stack loading problem to minimize blockages
• A Lagrangian-ACO matheuristic for car sequencing
• Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339550)