DOI: 10.5176/2251-2446_CAR21
Authors: Fawaz Al-Anzi and Ali Allahverdi
Abstract: We address the two-stage multi-machine assembly scheduling problem to minimize total completion time of all jobs. The first stage consists of m independently working machines where each machine produces its own components. The second stage consists of two independent and identical assembly machines. The processing of a job at the second stage cannot start until its two components, produced by the two machines at the first stage, are complete. This problem has been recently addressed in the literature for which an efficient heuristic was developed for the case of m=2. In this paper, we propose a new heuristic for the problem, and show that the proposed heuristic performs much better than the earlier developed heuristics.
Keywords: Scheduling, assembly flowshop, total completion time, heuristic
Updating...