首页 | 本学科首页   官方微博 | 高级检索  
     

考虑特殊时间约束的混合流水车间调度
引用本文:肖拥军,李铁克,尹兆涛.考虑特殊时间约束的混合流水车间调度[J].计算机工程与应用,2010,46(8):205-207.
作者姓名:肖拥军  李铁克  尹兆涛
作者单位:北京科技大学经济管理学院,北京,100083
基金项目:国家自然科学基金Grant No.70771008,No.70371057~~
摘    要:针对等待时间受限的准时制混合流水车间调度问题,建立其约束满足优化模型。考虑到模型具有二元变量的复杂性特点,将原问题分解为多能力流水车间调度和机器指派两个子问题。在对多能力流水车间调度问题的约束满足优化求解过程中嵌入邻域搜索,从而提高算法的收敛性。数据实验表明模型和算法是可行和有效的。

关 键 词:混合流水车间(HFS)  准时制  等待时间受限  约束满足优化
收稿时间:2008-9-9
修稿时间:2008-11-13  

Hybrid How Shop scheduling with special time constraints
XIAO Yong-jun,LI Tie-ke,YIN Zhao-tao.Hybrid How Shop scheduling with special time constraints[J].Computer Engineering and Applications,2010,46(8):205-207.
Authors:XIAO Yong-jun  LI Tie-ke  YIN Zhao-tao
Affiliation:XIAO Yong-jun,LI Tie-ke,YIN Zhao-tao School of Economics , Management,University of Science , Technology Beijing,Beijing 100083,China
Abstract:A constraint satisfaction optimization model is established for the problem of just in time hybrid flowshop scheduling with limited waiting time.Considering the problem's complicated characteristic of having binary variables,this paper decomposes it into a Multiple Capacitated Flowshop Scheduling(MCFS) problem and a machine allocation problem.During the process of solving the MCFS problem,a local search is embedded into the procedure of constraint satisfaction optimization so as to improve the convergence o...
Keywords:Hybrid Flow Shop(HFS)  just in time  limited waiting time  constraint satisfaction optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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