Sequencing to Minimize Work Overload in Assembly Lines with Product Options
Candace Arai Yano and
Ram Rachamadugu
Additional contact information
Candace Arai Yano: Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117
Ram Rachamadugu: School of Business Administration, University of Michigan, Ann Arbor, Michigan 48109
Management Science, 1991, vol. 37, issue 5, 572-586
Abstract:
We address the problem of sequencing jobs, each of which is characterized by one of a large number of possible combinations of customer-specified options, on a paced assembly line. These problems arise frequently in the automotive industry. One job must be launched into the system at equal time intervals, where the time interval (or cycle time) is prespecified. The problem is to sequence the jobs to maximize the total amount of work completed, or equivalently, to minimize the total amount of incomplete work (or work overload). Since there is a large number of option combinations, each job is almost unique. This fact precludes the use of existing mixed model assembly line sequencing techniques. We first consider the sequencing problem for a single station which can perform two different sets of operations. We characterize the optimal solution for this problem and use the results as the basis for a heuristic procedure for multiple stations. Computational results with data from a major automobile company are reported.
Keywords: assembly lines; sequencing; dynamic programming; heuristics (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (35)
Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.37.5.572 (application/pdf)
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:inm:ormnsc:v:37:y:1991:i:5:p:572-586
Access Statistics for this article
More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().