摘要
本文中,我们考虑了带有机器准备时间且允许重排的两台平行机在线排序问题.其目标为极小化最大完工时间.我们研究了两种不同的模型,并分别给出了最好可能的算法.
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.
出处
《运筹学学报》
CSCD
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)
关键词
运筹学
在线排序
机器准备时间
重排
竞争比
Operations research
online scheduling
machine available time
reassignment
competitive ratio
