期刊文献+

多联票据订单调度问题的多目标优化算法 被引量:2

Multi-objective optimization algorithm for multi-page invoice order scheduling problem
在线阅读 下载PDF
导出
摘要 针对多联票据订单调度问题进行研究,考虑最小化所有订单的最大完成时间、平均完成时间、最大延迟时间和平均延迟时间四个目标函数,提出一种多目标混合遗传算法。基于问题自身的特点提出完整解的构造算法,使用随机变动的权重实现多维多方向的搜索,设计了基于非主导性比较的局部搜索算法以寻找更多更好的非主导解,建立与更新全局非主导解集档案以保留最好的Pareto近似最优解。采用Pareto兼容的衡量参数,将该算法与两种对照算法进行了比较。大量算例的试验结果表明,该算法能够得到更接近于Pareto前沿且多样性分布更好的Pareto近似最优解集。 Aiming at the multi-page invoice order scheduling problem,a Multi-Objective Hybrid Genetic Algorithm(MOHGA) was presented by minimizing the maximum order completion time,average order completion time,maximum tardiness and average tardiness of all orders.A complete solution generation algorithm was proposed based on the problem characteristic,and a random weight vector was used at each iteration of selection to realize various search directions.To find more and better non-dominated solutions,a local search algorithm based on non-dominated ranking was proposed,and a global non-dominated solution archive was updated to keep the best approximate Pareto solutions.To validate the performance of the proposed algorithm,MOHGA was compared with two prominent multi-objective genetic algorithms based on a Pareto-compliant quality indicator-Hypervolumn.Numerical experiment indicated that a reasonable approximation of Pareto optimal set was obtained by MOHGA.
出处 《计算机集成制造系统》 EI CSCD 北大核心 2012年第5期1061-1070,共10页 Computer Integrated Manufacturing Systems
基金 国家自然科学基金资助项目(70671081 70572086 71072081 71172108) 辽宁省自然科学基金资助项目(20052140)~~
关键词 订单调度 柔性 多目标 混合遗传算法 PARETO最优 order scheduling flexible multi-objective hybrid genetic algorithms Pareto optimal
  • 相关文献

参考文献24

  • 1LIN B M T, KONONOV A V. Customer order scheduling to minimize the number of late jobsEJ. European Journal of Op- erational Research, 2007,183 (2) : 944-948.
  • 2LEUNG J Y T, LI H, PINED() M. Scheduling orders on ei- ther dedicated or flexible machines in parallel to minimize total weighted completion time[-J. Annals of Operations Research, 2008,159(1) : 107-123.
  • 3周水银,陈荣秋.单机加权成套订单数遗传算法研究[J].系统工程,2005,23(5):22-24. 被引量:16
  • 4EREL E, GHOSH J B. Customer order scheduling on a single machine with family setup times: complexity and algorithms J. Applied Mathematics and Computation,2007,185(1) : 11- 18.
  • 5吴春辉,周水银.并行多机加权成套订单数极大化的混合遗传算法[J].系统工程理论与实践,2006,26(11):125-129. 被引量:5
  • 6YANG J. Customer order scheduling problem on parallel ma- chines with identical order size EJ. International Journal of Management Science, 2007,13 (2) : 47-77.
  • 7LEUNG J Y T, LEE C Y, NG C W, et al. Preemptive multi- processor order scheduling to minimize total weighted flowtime I-J3. European Journal of Operational Researeh,2008,190(1): 40-51.
  • 8周水银,刘焰峰.服务水平约束下流水车间成套订单调度研究[J].中国管理科学,2009,17(4):69-74. 被引量:5
  • 9LIN B M T, CHENG T C E. Fabrication and assembly sched- uling in a two-machine flowshopEJ3, liE Transactions, 2002, 34(11) : 1015-1020.
  • 10张燕,周支立.混合整数规划求解多联票据印刷过程中的生产调度问题[J].运筹与管理,2009,18(6):136-145. 被引量:1

二级参考文献35

  • 1卢冰原,陈华平,古春生,谷峰.基于模糊逻辑的偏柔性工作车间调度模型[J].中国管理科学,2004,12(6):52-55. 被引量:5
  • 2周水银,陈荣秋.单机加权成套订单数遗传算法研究[J].系统工程,2005,23(5):22-24. 被引量:16
  • 3周水银,盛培锋.面向成套订单问题的工艺规划与排序的集成研究1[J].中国管理科学,2006,14(5):73-80. 被引量:4
  • 4Ruiz R. , Maroto C.. A comprehensive review and evaluation of permutation flowshop heuristics[J]. European Journal of Operational Research, 2005, 165 : 479-494.
  • 5Federico, C.. Jatinder, G. , Roberto, T.. Minimizing tardy jobs in a flowshop with common due date[J]. European Journal of Operational Research, 2000, 120 (25): 375-381.
  • 6Chen,W. J. Minimizing number of tardy jobs on a single machine subject to periodic maintenance[J]. The International Journal of Management Science, 2008, in press.
  • 7Alex, J. , Grisselle,C.. Minimizing the number of late jobs for the permutation flowshop problem with secondary resources[J]. Computers &Operations Research, 2008, 35(3):1227-1249.
  • 8Daniels,L. , Chambers,J.. Multi-objective flow shop scheduling[J]. Naval Research Logistics, 1990, 37: 981-995.
  • 9Framinana, J. M. , Leisten, R.. A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness[J]. Int. J. Production Economics, 2006, 99 (1-2): 28-40.
  • 10Chakravarthy, K. , Rajendran, C.. A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization[J]. Production Planning and Control, 1999, 10: 707-714.

共引文献22

同被引文献19

  • 1吴尔飞,金烨,胡小锋,沈健.基于分支定界方法的双边装配线平衡[J].东华大学学报(自然科学版),2006,32(4):11-16. 被引量:6
  • 2HILL T.Manufacturing strategy[M].New York:Irwin McGraw-Hill,2005.
  • 3Alidaee B,Kochenberger G A,Aminim M.Greedy solutions of selection and ordering problems[J].European Journal of Operational Research,2011,134:203-215.
  • 4Slotnick S A,Morton T E.Order acceptance with weighted tardiness[J].Computers&Operations Research,2007,34:3029-3042.
  • 5Ceyda O,Salman S,Yalcin F B,et al.Order acceptance and scheduling decisions in make-to-order systems[J].International Journal of Production Economics,2010,125(1):200-211.
  • 6Rom W O,Slotnick S A.Order acceptance using genetic algorithms[J].Computers and Operations Research,2009,36:1758-1767.
  • 7Ravir K P,Tayur S.Scheduling and reliable lead-time quotation for orders with availability intervals and leadtime sensitive revenues[J].Management Science,2011,47(2):264-279.
  • 8Roundy R,Chen C,Chen P,et al.Capacity-driven acceptance of customer orders for a multi-stage batch manufacturing system:models and algorithms[J].IIE Transactions,2010,37(12):1093-1095.
  • 9张欣,马士华.基于有限生产能力和产出缓存的订单接受策略[J].工业工程与管理,2008,13(2):34-38. 被引量:17
  • 10苏平,于兆勤.基于混合遗传算法的混合装配线排序问题研究[J].计算机集成制造系统,2008,14(5):1001-1007. 被引量:27

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部