Robust Scheduling for Single Machine with Rush Orders

摘要：

　　Rush orders may arrive during scheduling implementation, which would disturb the initial schedule and deteriorate corresponding objective values because of its highest priority.This paper presents a robust algorithm for the problem 1| rj|ΣTj with rush orders.First, considering the fact that problem 1 | rj|ΣTj is NP-hard, top-pyramid which is established in the light of relationships between release times and due dates of different jobs is used to obtain a set of dominant schedules.And then, the set of initial schedules is achieved.Based on the dominant initial schedules, a robust scheduling algorithm for dealing with rush orders is provided.At last, an example is illustrated to show the effectiveness of the algorithm.

关键词： rush order single machine dominance rule robust scheduling

作者: Xianchao ZHANG Hong ZHOU

作者单位: School of Economics and Management, Beihang University, Beijing, China

会议类型: 国内会议

会议名称: Thirteenth Chinese Conference,SSTA 2011(第十三届中国系统仿真技术及其应用学术会议)

会议地点: 黄山

会议语种:英文

页码: 28-32

在线出版日期: 2011-08-03（万方平台首次上网日期，不代表论文的发表时间）