急件到达干扰下开放式车间重调度方法  

Open shop rescheduling approache under unexpected arrival of a rush job

作　　者：刘乐[1] 周泓[2] 

机构地区：[1]济南大学管理学院,山东济南250002 [2]北京航空航天大学经济管理学院,北京100191

出　　处：《计算机集成制造系统》2014年第7期1631-1642,共12页Computer Integrated Manufacturing Systems

基　　金：国家自然科学基金资助项目(71071008);济南大学科研基金资助项目(XKY1322);教育部人文社科研究青年基金资助项目(14YJCZH098)~~

摘　　要：针对开放式车间中突发的急件到达干扰,研究如何有效地执行扰后重新调度任务。基于匹配式调度策略探索扰后实施重调度的具体方法;为了形成四种可行的重调度实施方案,不仅兼顾了面向分离、连续空闲时间的两种重调度时域确定方式,还在约简式调度阶段设计了两种特效的启发式算法。仿真实验模拟了大量急件干扰下的重调度情景,并从完工期、急件的相对完工时间及序位相似性三方面分别设定了重调度绩效指标,进而对四种所提方案进行了同情景独立观测。实验结果显示,急件到达干扰越晚出现,所提重调度方案的整体应对效果越好;此外,通过统计分析不同实施方案所对应的观测结果,得出了若干有关扰后重调度方案选取的适用性建议。Aiming at the unexpected arrival of a rush job in an open shop, how to conduct the effective rescheduling was investigated. Specific rescheduling approaches after disruption were explored based on match-up scheduling strategy. To form four alternative rescheduling schemes, two reschcduling horizon determination methods oriented to split idle times-related or continuous idle times-related were proposed, and two problem-specific heuristics algo- rithm were designed in reduced scheduling stage. In simulation experiments, various rescheduling scenarios under rush job distraction were simulated, and the rescheduling performance indicators were set respectively from makespan, relative completion time of rush job and sequence similarity, thus the four proposed schemes were observed un der the same scene independently. Experimental results indicated that the later the rush job arrives, the relatively better the proposed schemes perform. Furthermore, several applicable suggestions about the choice among schemes were obtained by statistical analysis of the observation results related to different rescheduling schemes.

关 键 词：重调度 开放式车间 急件到达 匹配式策略 稳定性 

分 类 号：F406.2[经济管理—产业经济] TP278[自动化与计算机技术—检测技术与自动化装置]