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

具有学习效果的两机流水车间调度启发式算法研究
引用本文:黄敏镁,罗荣桂,袁际军.具有学习效果的两机流水车间调度启发式算法研究[J].武汉理工大学学报(交通科学与工程版),2007,31(5):931-934.
作者姓名:黄敏镁  罗荣桂  袁际军
作者单位:1. 华南师范大学公共管理学院,广州,510006
2. 武汉理工大学管理学院,武汉,430070
3. 湖南大学工商管理学院,长沙,410082
摘    要:以最小化时间表长为目标函数,对具有学习效果的两机流水车间调度问题进行研究.由于工序加工时间引入了学习效果,传统的Johnson法则和NEH启发式算法不再适用.针对该问题的NP-hard特性,提出了JNEH和MNEH两种求解问题的多项式启发式算法.计算机数据实验证明了新的启发式算法求解问题的可行性和有效性;表明了JNEH启发式算法和MNEH启发式算法对小规模问题求解的精度更高、稳定性更好;同时证明MNEH启发式算法对求解大规模问题具有比传统算法更好的寻优性能和鲁棒性.

关 键 词:流水车间  学习效果  启发式算法  最小化时间表长
修稿时间:2007-04-24

Heuristics for Permutation Flowshop Scheduling with Learning Effect
Huang Minmei,Luo Ronggui,Yuan Jijun.Heuristics for Permutation Flowshop Scheduling with Learning Effect[J].journal of wuhan university of technology(transportation science&engineering),2007,31(5):931-934.
Authors:Huang Minmei  Luo Ronggui  Yuan Jijun
Institution:1.College of Public Administration, South China Normal University, Guangzhou 510006;2.School of Management, Wuhan University of Technology, Wuhan 430070;3.College of Business Administration, Hunan University, Changsha 410082
Abstract:The problem of flowshop scheduling with the effect of learning to minimize makespan is studied.It is shown in this paper that with the introduction of learning to operation processing times,the optimal schedule for two machine flowshop problem is different from that of the classic version of the problem.Two heuristics are proposed to solve this problem in polynomial time.Extensive computational experiments carried out prove the feasibility and effectiveness of the proposals;and show that both of the proposed JNEH and MNEH heuristic algorithms perform the existing heuristics better for small problems in solution accuracy;while the performance of the MNEH heuristics is efficient and robust for large problems.
Keywords:flowshop  learning effect  heuristics  makespan minimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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