A survey of exact algorithms for the simple assembly line balancing problem
Management Science
Sequencing to minimize work overload in assembly lines with product options
Management Science
Sequencing JIT mixed-model assembly lines
Management Science
Modern heuristic techniques for combinatorial problems
Algorithms for real-time scheduling of jobs on mixed model assembly lines
Computers and Operations Research
Tabu Search
A scatter search based hyper-heuristic for sequencing a mixed-model assembly line
Journal of Heuristics
Expert Systems with Applications: An International Journal
Key performance indicators for the evaluation of balanced lines
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
In this paper, the problem of sequencing mixed-model assemblylines in case of fixed rate launching and closed stations isconsidered. The problem consists of finding an intermixedsequence of different models of a basic product, which arejointly produced on an assembly line, such that customer demandsare fulfilled and total work overload is minimized. For solvingthis problem an informed tabu search procedure with a patternbased vocabulary building strategy is developed. Computationaltests demonstrate that considerable improvements are obtained bycomparison to methods which do not incorporate such an approach.