Optimal mixed-model sequencing for balanced assembly lines

Em Dar-El and S Cucuy

Omega, 1977, vol. 5, issue 3, 333-342

Abstract: This paper describes an algorithm for solving optimally, the mixed-model sequencing problem when assembly line stations are balanced for each model. An optimal sequence is obtained with the minimization of the overall assembly line length for zero station idle time. The algorithm incorporates two basic steps. The first involves a search procedure that generates all cycle sequences; i.e. sequences having identical 'start' and 'finish' positions and whose work content can be executed within a defined station length. The second step uses integer programming (IP) to determine the number and combination of the various cycle sequences, such that the production demand is satisfied.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(77)90115-3
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:5:y:1977:i:3:p:333-342

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().