English

运筹学学报 ›› 2010, Vol. 14 ›› Issue (3): 19-30.

• 运筹学 • 上一篇    下一篇

 带有机器准备时间且允许重排的在线排序

侯丽英, 康丽英   

  • 出版日期:2010-09-15 发布日期:2010-09-15

Online Scheduling with Reassignment under  Non-Simultaneous Machine Available Times

Hou Liying, Kang Liying   

  • Online:2010-09-15 Published:2010-09-15

摘要： 本文中, 我们考虑了带有机器准备时间且允许重排的两台平行机在线排序问题. 其目标为极小化最大完工时间. 我们研究了两种不同的模型, 并分别给出了最好可能的算法.

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.