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

服务水平约束下流水车间成套订单调度研究
引用本文:周水银,刘焰峰.服务水平约束下流水车间成套订单调度研究[J].中国管理科学,2009,17(4):69-74.
作者姓名:周水银  刘焰峰
作者单位:华中科技大学管理学院, 湖北武汉430074
基金项目:国家自然科学基金资助项目(70572032)
摘    要:本文针对流水车间环境,研究了服务水平约束下成套订单的调度问题,通过建立与分析该问题的模型,研究并设计了用于排序的三种构造式启发算法,以及用于确定订单成套数的构造式启发算法、改进遗传算法和模拟退火算法,最后通过各种规模及不同约束度的算例进行模拟计算与比较分析,结果表明了改进遗传算法的有效性,但其它两种算法也各有优点。

关 键 词:流水车间  成套订单  服务水平  调度  
收稿时间:2008-9-22
修稿时间:2009-6-2

Study on Scheduling of Whole-Set Orders under Flow-Shop with Service Level Constraints
ZHOU Shui-yin,LIU Yan-feng.Study on Scheduling of Whole-Set Orders under Flow-Shop with Service Level Constraints[J].Chinese Journal of Management Science,2009,17(4):69-74.
Authors:ZHOU Shui-yin  LIU Yan-feng
Institution:School of Management, Ifuazhong University of science and Technology, Wuhan 430074, China
Abstract:In this paper,we analyze the scheduling of whole-set orders under flow-shop with service level constraint.Then we present a mathematical model,and also propos three construction heuristics for scheduling and three heuristics for order sets respectively based on constructive method,genetic and simulated annealing algorithm. At the end,some simulations for evaluations are made,and the results show that the genetic algorithm is most effective,but the other two have their own advantages.
Keywords:flow-shop  whole-set order  service level  scheduling  
点击此处可从《中国管理科学》浏览原始摘要信息
点击此处可从《中国管理科学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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