Algorithms for the car sequencing and the level scheduling problem

Authors:
Andreas Drexl;Alf Kimms;Lars Matthießen
Affiliations:
Department of Business Administration, University of Kiel, Kiel, Germany 24098;Department of Technology and Operations Management, University of Duisburg-Essen, Duisburg, Germany 47048;Department of Computer Science, University of Kiel, Kiel, Germany 24098
Venue:
Journal of Scheduling
Year:
2006

Citing 11
Cited 4

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

Journal of Automated Reasoning
Car wars: (almost) birth of an expert system

AI Expert
Level schedules for mixed-model assembly lines in just-in-time production systems

Management Science
Sequencing to minimize work overload in assembly lines with product options

Management Science
A note on “level schedules for mixed-model assembly lines in just-in-time production systems”

Management Science
Sequencing JIT mixed-model assembly lines

Management Science
Level schedules for mixed-model, Just-in-Time processes

Management Science
Mixed-model sequencing to minimize utility work and the risk of conveyor stoppage

Management Science
Sequencing in mixed model assembly lines: a genetic algorithm approach

Computers and Operations Research
Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints

Management Science
On the complexity of the car sequencing problem

Operations Research Letters

Fair referee assignments for professional football leagues

Computers and Operations Research
The search for the optimal number of kanbans in unstable assembly-tree layout systems under intensive loading conditions

International Journal of Computer Integrated Manufacturing - THE CHALLENGES OF MANUFACTURING IN THE GLOBALLY INTEGRATED ECONOMY. GUEST EDITOR: ROBIN G. QIU
On the complexity of the car sequencing problem

Operations Research Letters
Key performance indicators for the evaluation of balanced lines

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with two most important problems arising in sequencing mixed-model assembly lines. One problem is to keep the line's workstations loads as constant as possible (the 'car sequencing problem') while the other is to keep the usage rate of all parts fed into the final assembly as constant as possible (the 'level scheduling problem'). The first problem is a difficult constraint-satisfaction problem while the second requires to optimize a nonlinear objective function. The contribution of this paper is twofold: First, we describe a branching scheme and bounding algorithms for the computation of feasible sequences for the car sequencing problem. Second, we present an algorithm which can optimize a level scheduling objective while taking care of the car sequencing constraints. Computational results are presented which show that feasible sequences can be obtained quickly for large problem instances.