Operations Research Transactions ›› 2010, Vol. 14 ›› Issue (3): 19-30.
• Original Articles • Previous Articles Next Articles
Hou Liying, Kang Liying
Online:
Published:
Abstract: In this paper, we consider online scheduling problems on two parallel machines with reassignment under non-simultaneous machine available times. The objective is to minimize the maximum completion time (makespan). We study two different versions and propose the best possible algorithms.
Hou Liying, Kang Liying. Online Scheduling with Reassignment under Non-Simultaneous Machine Available Times[J]. Operations Research Transactions, 2010, 14(3): 19-30.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.ort.shu.edu.cn/EN/
https://www.ort.shu.edu.cn/EN/Y2010/V14/I3/19
