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

带有限容量缓冲库的多目标柔性作业车间调度优化
引用本文:李琳,霍佳震.带有限容量缓冲库的多目标柔性作业车间调度优化[J].系统工程理论与实践,2010,30(10):1803-1814.
作者姓名:李琳  霍佳震
作者单位:1. 华东理工大学 商学院, 上海 200237;2. 同济大学 经济与管理学院,上海 200092
基金项目:国家自然科学基金重点项目,上海市科委重点攻关项目,上海市重点学科建设项目
摘    要:研究一类从无缝钢管生产实际中提炼出的作业车间调度问题.该问题具有生产工序间存在有限容量缓冲库,生产工艺路径柔性选择,生产设备需要转换时间,生产调度多目标等特点.针对具有这些特点的调度问题,构建了混合整数规划模型.鉴于其NP-hard性,设计改进的遗传算法进行求解,进而提出辅以局部搜索优化算法的方法,并通过企业生产实际数据比较和验证算法的性能及有效性.该模型和算法已被用于无缝钢管生产作业计划软件系统的开发,并在实际运用中取得了良好的效果,对各大钢管企业的生产调度均具有一定的实际指导意义.

关 键 词:有限容量缓冲库  多目标柔性Job-Shop问题  混合整数规划模型  改进遗传算法  局部搜索优化算法  
收稿时间:2009-04-28

Multi-objective flexible job shop scheduling with buffer storage constraints
LI Lin,HUO Jia-zhen.Multi-objective flexible job shop scheduling with buffer storage constraints[J].Systems Engineering —Theory & Practice,2010,30(10):1803-1814.
Authors:LI Lin  HUO Jia-zhen
Institution:1. School of Business, East China University of Science and Technology, Shanghai 200237, China;2. School of Economics and Management, Tongji University, Shanghai 200092, China
Abstract:This paper considers a class of Job-Shop scheduling problem abstracted from the seamless steel tube production, which is characterized by finite buffer storage, flexible routes for every job, transform times between jobs and multi-objective of scheduling. We formulate it with mixed-integer- programming model. Given the problem is of NP-hard, improved genetic algorithm is suggested, then local search algorithm is presented based on it. We test and compare the performance of proposed algorithms, whose effectiveness can be well verified in scheduling decision support system for the production of seamless steel tubes of real company.
Keywords:finite buffer storage  multi-objective flexible Job-Shop scheduling problem  mixed-integer- programming model  genetic algorithm  local search algorithm  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《系统工程理论与实践》浏览原始摘要信息
点击此处可从《系统工程理论与实践》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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