| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 474667 | Computers & Operations Research | 2014 | 10 Pages |
Abstract
The identical parallel machine scheduling problem with the objective of minimizing total weighted completion time is considered in the online setting where jobs arrive over time. An online algorithm is proposed and is proven to be (2.5–1/2m)-competitive based on the idea of instances reduction. Further computational experiments show the superiority over other algorithms in the average performance.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jiping Tao,