A decomposition approach for the car resequencing problem with selectivity banks

Authors:
Nils Boysen;Michael Zenker
Affiliations:
Friedrich-Schiller-Universität Jena, Lehrstuhl für Operations Management, Carl-Zeií-Straíe 3, D-07743 Jena, Germany;Friedrich-Schiller-Universität Jena, Lehrstuhl für Operations Management, Carl-Zeií-Straíe 3, D-07743 Jena, Germany
Venue:
Computers and Operations Research
Year:
2013

Citing 8
Cited 0

Job-shop scheduling using automated reasoning: a case study of the car-sequencing problem

Journal of Automated Reasoning
Ant algorithms for discrete optimization

Artificial Life
The harpy speech recognition system.

The harpy speech recognition system.
Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints

Management Science
A stochastic beam search for the berth allocation problem

Decision Support Systems
Beam-ACO: hybridizing ant colony optimization with beam search: an application to open shop scheduling

Computers and Operations Research
A study of greedy, local search, and ant colony optimization approaches for car sequencing problems

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
On the complexity of the car sequencing problem

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

An important decision problem when mass-producing customized product to order is the sequencing problem, which decides on the succession of models launched down a mixed-model assembly line. To avoid work overload of workforce the car sequencing problem restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, in a subsequence of a certain length by applying sequencing rules. In the real-world, frequently perturbations occur stirring up an initially planed sequence, so that a resequencing is required. This paper treats the car resequencing problem where a selectivity bank, which is a special form of buffer organization consisting of parallel line segments without assembly operations, is applied to reshuffle a given initial sequence and rule violations are to be minimized. The problem is formalized and suited heuristic solution procedures are presented and tested. Furthermore, the impact of differently sized mix-banks on resequencing flexibility is investigated.