| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 475881 | Computers & Operations Research | 2009 | 4 Pages |
Abstract
A two parallel machines scheduling problem where one machine is periodically unavailable with the objective of minimizing makespan is considered. It is showed that the worst-case ratio of the classical LPT algorithm and the competitive ratio of the LS algorithm are 3/2 and 2, respectively, for the offline version and the online version of the problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Dehua Xu, Zhenmin Cheng, Yunqiang Yin, Hongxing Li,