A Lagrangean relaxation approach for the mixed-model flow line sequencing problem

Authors:
Deniz Türsel Eliiyi;Melih Özlen
Affiliations:
Department of Statistics, Dokuz Eylul University, Izmir 35160, Turkey;Department of Industrial Engineering, Middle East Technical University, Ankara 06531, Turkey
Venue:
Computers and Operations Research
Year:
2008

Citing 8
Cited 1

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
Level schedules for mixed-model, Just-in-Time processes

Management Science
Algorithms for real-time scheduling of jobs on mixed model assembly lines

Computers and Operations Research
Mixed-model sequencing to minimize utility work and the risk of conveyor stoppage

Management Science
A robust design of simulated annealing approach for mixed-model sequencing

Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
The Lagrangian Relaxation Method for Solving Integer Programming Problems

Management Science

The mixed-product assembly line sequencing problem of a door-lock company in Taiwan

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this study, a mixed-model flow line sequencing problem is considered. A mixed-model flow line is a special case of production line where products are transported on a conveyor belt, and different models of the same product are intermixed on the same line. We have focused on product-fixed, rate-synchronous lines with variable launching. Our objective function is minimizing makespan. A heuristic algorithm based on Lagrangean relaxation is developed for the problem, and tested in terms of solution quality and computational efficiency.