| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142922 | Operations Research Letters | 2008 | 5 Pages |
Abstract
This paper studies online scheduling problems with reassignment on two identical machines. We can reassign some jobs under certain rules after all the jobs have been assigned. Three different versions are studied and optimal algorithms are proposed.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Zhiyi Tan, Shaohua Yu,