| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 481491 | European Journal of Operational Research | 2008 | 7 Pages |
Abstract
We propose an off-line delayed-start LPT algorithm that sequences the first (longest) 5 jobs optimally and the remaining jobs according to the LPT principle on two identical parallel machines. We show that this algorithm has a sharper tight worst-case ratio bound than the traditional LPT algorithm for the sum of squares of machine completion times minimization problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Christos Koulamas, George J. Kyparisis,