【作者】 刘琳； 谷寒雨； 席裕庚；

【Author】 Liu Lin, Gu Hanyu, Xi Yugeng(Institute of Automation, Shanghai Jiao Tong University, Shanghai 200030. China)

【机构】 上海交通大学自动化研究所；

【摘要】 本文提出了一种以交货期调整为基础的Job shop调度迭代优化算法。首先根据工件的空闲时间确定每道工序的初始交货期,然后将活动调度算法与改进的MOD规则结合来确定调度顺序,不断调整工序的最早开始时间和交货期逐步改善调度性能。通过算例仿真研究,表明该算法的计算量小,性能指标较好,适用于实际的Job shop调度环境。更多还原

【Abstract】 A new iterative method for job shop scheduling based on adjusting due date to minimize total tardiness is proposed. The initial due date of each operation is determined according to slack time, then the job sequences on all machines are obtained by the improved modified operation due date rule based on active scheduling scheme. The due date and possible earliest start time of every operation are adjusted to improve the solution quality according to the sequence of last iteration. The simulation results show the proposed method can obtain good solutions with little computational burden, and can be applied to the practical fob shop scheduling system.更多还原