首页 | 官方网站   微博 | 高级检索  
     

带有跨工序约束的柔性job shop调度问题*
引用本文:沈益民,范玉顺.带有跨工序约束的柔性job shop调度问题*[J].计算机应用研究,2008,25(7):2023-2026.
作者姓名:沈益民  范玉顺
作者单位:清华大学,自动化系,北京,100084
基金项目:国家“863”计划资助项目(2006AA04Z166,2006AA04Z157);国家自然科学基金资助项目(60504028)
摘    要:飞机制造企业的金属加工车间是一种小批量、多品种生产,其生产指挥是一种带有跨工序约束的柔性job shop调度问题。针对这个NP-hard问题,提出一种三阶段启发式方法,通过依次完成瓶颈工作中心的判定、设备分配和任务排序,使这一问题的复杂度得以逐步降低,从而可以在多项式时间内得到有效的调度方案。实际运行表明,依据该启发式方法产生的调度方案,其关键路径的等待时间占总完工时间的比例不足1.5%,取得了满意的效果。

关 键 词:柔性作业车间  调度问题  跨工序约束  启发式算法

Scheduling flexible job shop problem with inter-stage constraint
SHEN Yi-min,FAN Yu-shun.Scheduling flexible job shop problem with inter-stage constraint[J].Application Research of Computers,2008,25(7):2023-2026.
Authors:SHEN Yi-min  FAN Yu-shun
Affiliation:(Dept. of Automation, Tsinghua University, Beijing 100084, China)
Abstract:The metal-processing shop of airplane manufacturing is a small-batch and multi-variety production where a job shop scheduling problem with inter-stage constraint needs to be solved.This paper presented a three-phase heuristic approach to deal with this NP-hard problem. During the process of determining the bottleneck work center, arranging the devices, and ordering the jobs,reduced the complexity of the problem gradually. Therefore obtained an effective solution within polynomial time. Application sample shows that the heuristic approach is satisfactory as the idle time of the critical path is less than 1.5% of the completing time.
Keywords:flexible job shop  scheduling problem  inter-stage constraint  heuristic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号