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

Online Scheduling with Reassignment under Non-Simultaneous Machine Available Times

作　　者：侯丽英[1] 康丽英[1] 

机构地区：[1]上海大学数学系,上海200444

出　　处：《运筹学学报》2010年第3期19-30,共12页Operations Research Transactions

基　　金：Research was partially supported by the National Nature Science Foundation of China(Nos.60773078);Shanghai Leading Academic Discipline Project(No.S30104)

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

关 键 词：运筹学 在线排序 机器准备时间 重排 竞争比 

分 类 号：O223[理学—运筹学与控制论]