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

等待时间受限的流水车间调度问题的若干性质
引用本文:王柏琳,李铁克.等待时间受限的流水车间调度问题的若干性质[J].系统工程理论与实践,2012,32(6):1346-1352.
作者姓名:王柏琳  李铁克
作者单位:1. 北京科技大学 东凌经济管理学院, 北京 100083;2. 钢铁生产制造执行系统技术教育部工程研究中心, 北京 100083
基金项目:国家自然科学基金(70771008);教育部博士学科点专项科研基金(20100006110006);中央高校基本科研业务费专项资金(FRF-AS-09-007B,FRF-TP-12-116A)
摘    要:等待时间受限的流水车间调度问题广泛存在于高温连续作业或中间产品不稳定的流水车间生产管理过程中, 要求工件在相邻机器上的等待时间不能超过一定的上限. 针对以最小化最大完工时间为目标函数的该类问题, 研究了加工机器上的工件序列特征, 并在此基础上分析了基于排列排序进行问题求解的可行性和有效性, 为算法求解提供了理论依据.

关 键 词:流水车间  生产调度  等待时间受限  排列排序  
收稿时间:2010-10-11

Some properties of the flowshop scheduling problem with limited waiting time constraints
WANG Bai-lin , LI Tie-ke.Some properties of the flowshop scheduling problem with limited waiting time constraints[J].Systems Engineering —Theory & Practice,2012,32(6):1346-1352.
Authors:WANG Bai-lin  LI Tie-ke
Institution:1. Dongling School of Economics and Management, University of Science and Technology Beijing, Beijing 100083, China;2. Engineering Research Center of MES Technology for Iron & Steel Production, Ministry of Education, Beijing 100083, China
Abstract:A flowshop scheduling problem under the production environment with high temperature and continuity generally meets the limited waiting time constraints,which require the waiting time of any job between consecutive machines is not greater than a given value.Some properties of the flowshop scheduling problem with limited waiting time constraints to minimize the makespan are studied.Based on a deep discussion on the characters of job sequences on machines,the feasibility and validity of problem-solving approaches concerning permutation schedules are analyzed,which provides the theoretical foundation and instruction for algorithm design.
Keywords:flowshop  scheduling  limited waiting times  permutation schedule
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《系统工程理论与实践》浏览原始摘要信息
点击此处可从《系统工程理论与实践》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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