工业工程2012，Vol.15Issue(5)：118-124,7.DOI:10.3969/j.issn.1007-7375.2012.05.020
考虑急件到达的单机鲁棒调度方法
A Robust Single Machine Scheduling Algorithm with Rush Orders
摘要
Abstract
Rush orders are common in practical production. With high priority, rush orders disturb the schedule being executed and degrade scheduling performance. Aiming at reducing the degradation of scheduling performance and hedging against the rush orders, a robust scheduling algorithm is presented for single machine job release problem with total tardiness as objective. Due to the NP-hard nature of the problem, a special structure called top-pyramid is established in the light of relationship between the release time and due dates of different jobs. In this way, dominant properties can be obtained. Then, the dominant properties are analyzed when rush orders arrives by considering the characteristics of rush orders, and alternative robust schedules are found. With simulation, an example is given to verify the effectiveness of the proposed algorithm. It shows that the proposed robust scheduling algorithm can effectively reduce scheduling performance degradation caused by rush orders.关键词
鲁棒调度/急件/单机调度/占优规则Key words
robust scheduling/ rush orders/ single-machine scheduling, priority rules分类
信息技术与安全科学引用本文复制引用
张先超,周泓..考虑急件到达的单机鲁棒调度方法[J].工业工程,2012,15(5):118-124,7.基金项目
国家自然科学基金资助项目(71071008,70821061) （71071008,70821061）
