Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
7540981 | Computers & Industrial Engineering | 2018 | 33 Pages |
Abstract
This paper studies a two-stage assembly problem to minimize the total completion time. The two-stage assembly system consists of multiple machines in the first stage, and an assembly machine in the second stage. Each job consists of multiple components. In the first stage each component is processed on the dedicated machine. In the second stage, the processed components of each job are shipped and assembled into a product on the assembly machine. This system is a generalization of flowshop, which has practical applications in assembly-driven manufacturing. The objective is to establish an efficient schedule minimizing the total completion time. Six lower bounds are proposed and evaluated in a branch-and-bound algorithm. Also, four efficient heuristic algorithms are developed to generate near-optimal schedules. The computational results show that the derived B&B and heuristic algorithms perform very well within reasonable time.
Related Topics
Physical Sciences and Engineering
Engineering
Industrial and Manufacturing Engineering
Authors
Ik Sun Lee,