| Article ID: | iaor20091010 |
| Country: | Netherlands |
| Volume: | 36 |
| Issue: | 2 |
| Start Page Number: | 250 |
| End Page Number: | 254 |
| Publication Date: | Mar 2008 |
| Journal: | Operations Research Letters |
| Authors: | Tan Zhiyi, Yu Shaohua |
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.