Optimal mixed-model sequencing for balanced assembly lines
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 5 (1977)
Issue (Month): 3 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:5:y:1977:i:3:p:333-342. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.