Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475902 | Computers & Operations Research | 2009 | 13 Pages |
Abstract
We study the problem of minimizing total completion time in the two-machine flow shop with exact delay model. This problem is a generalization of the no-wait flow shop problem which is known to be strongly NP-hard. Our problem has many applications but little results are given in the literature so far. We focus on permutation schedules. We first prove that some simple algorithms can be used to find the optimal schedules for some special cases. Then for the general case, we design some heuristics as well as metaheuristics whose performance are shown to be effective by computational experiments.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Yumei Huo, Haibing Li, Hairong Zhao,