Efficient methods for sequencing minimum job sets on mixed model assembly lines

Ahmet Bolat

Naval Research Logistics (NRL), 1997, vol. 44, issue 5, 419-437

Abstract: For sequencing different models on a paced assembly line, the commonly accepted objective is to keep the operators within the boundaries of their stations. When the operators reach the right boundary, they terminate the operation prematurely. In this article we address the problem of sequencing jobs decomposed into identical and repeating sets to minimize the total amount of remaining work, or, equivalently, to maximize the total amount of work completed. We propose an optimum algorithm and a heuristic procedure that utilizes different priority functions based on processing times. Experimental results indicate that the proposed heuristic requires less computational effort and performs better than the existing procedures: On the average, 11–14% of improvements are obtained over real data mentioned in the literature (20 groups of 1000 jobs from a U.S. automobile manufacturer). © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 419–437, 1997

Date: 1997
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199708)44:53.0.CO;2-7

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:wly:navres:v:44:y:1997:i:5:p:419-437

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().