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

✍ Scribed by Ahmet Bolat

• Publisher: John Wiley and Sons
• Year: 1997
• Tongue: English
• Weight: 119 KB
• Volume: 44
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/(sici)1520-6750(199708)44:5<419::aid-nav2>3.0.co;2-7

✦ Synopsis

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).