期刊文献+

基于订单总拖期的仓储作业调度建模与优化 被引量:5

Modeling and Optimization on Operation Scheduling with Total Tardiness Objective for a Storage System
下载PDF
导出
摘要 以最小化各订单的总拖期为目标,建立了仓储系统备货作业的两阶段混合流水调度模型.该模型将调度过程分解为多个阶段,并针对各阶段设计了不同的调度规则,通过数字实验选出最适合该模型的规则组合.使用选定的规则组合产生初始解,并在此基础上设计了两阶段的禁忌搜索算法,对巷道堆垛机上各作业任务的执行顺序进行调整,进一步降低订单的总拖期.计算结果证明了该算法的可行性和有效性. This paper proposed a two stage hybrid flows tomer orders in a storage system. Several heuristics rules compared to each other to select the best one for the initi based on the selected rule combination is further used to lane stackers. The computational experiments show the hop model to minimize the total tardiness of cusare developed, and their various combinations are al solution of this problem. A tabu search method optimize the processing sequence of operations on efficiency of the developed algorithm.
作者 陈旻 陆志强
出处 《上海交通大学学报》 EI CAS CSCD 北大核心 2009年第12期1916-1922,共7页 Journal of Shanghai Jiaotong University
基金 国家自然科学基金资助项目(70771065) 上海市浦江人才计划资助项目(07PJ14052)
关键词 仓储系统 混合流水车间调度 订单 总拖期 禁忌搜索 storage system hybrid flowshop scheduling order total tardiness tabu search
  • 相关文献

参考文献9

  • 1Gupta J. Two stage hybrid flow-shop scheduling problem[J]. Journal of the Operational Research Society, 1988, 39: 359-364. 被引量:1
  • 2Du J, Leung J. Minimizing total tardiness on one machine is NP-Hard [J].Mathematics of Operation Re-search, 1990, 15:483-495. 被引量:1
  • 3Koulamas C. The total tardiness problem: Review and extensions [J]. Operations Research, 1994, 42 (6) : 1025-1041. 被引量:1
  • 4Ruiz R, Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics [J].European Journal of Operational Research, 2005, 165 : 479-494. 被引量:1
  • 5Taillard E. Benchmarks for basic scheduling problems[J]. European Journal of Operational Research, 1993, 64 : 278-285. 被引量:1
  • 6Roneoni D, Henriques L. Some heuristic algorithms for total tardiness minimization in a flowshop with blocking [J].Omega, 2009, 37: 272-281. 被引量:1
  • 7Haouari M, M' Hallah R. Heuristic algorithms for the two-stage hybrid flowshop problem [J]. Operations Research Letters, 1997, 21 : 43-53. 被引量:1
  • 8Negenman E G. Local search algorithms for the multiprocessor flow shop scheduling problem [J].European Journal of Operational Research, 2001, 128: 147-158. 被引量:1
  • 9陈璐,奚立峰,蔡建国,Nathalie Bostel,Pierre Dejax.一种求解带有阻塞限制的混合流水车间的禁忌搜索算法[J].上海交通大学学报,2006,40(5):856-859. 被引量:11

二级参考文献8

  • 1Sawik T J. A scheduling algorithm for flexible flow lines with limited intermediate buffers[J]. Applied Stochastic Models and Data Analysis, 1993, 9:127-138. 被引量:1
  • 2Nowicki E. The permutation flow shop with buffers:A tabu search approach[J]. European Journal of Operational Research, 1999, 116: 205-219. 被引量:1
  • 3Pinedo M. Scheduling theory, algorithms, and systems[M]. 2nd ed. New Jersey: Prentice Hall, 2002. 被引量:1
  • 4Vigo D, Toth P. The vehicle routing problem[M].Philadelphia: Monographs on Discrete Mathematics and Applications, SIAM, 2002. 被引量:1
  • 5Glover F. Tabu search. Part Ⅰ[J]. ORSA Journal of Computing, 1989, 1(3):190-206. 被引量:1
  • 6Glover F. Tabu search. Part Ⅱ[J]. ORSA Journal of Computing, 1990, 2(1): 4-32. 被引量:1
  • 7Santos D L, Hunsucker J L, Deal D E. Global lower bounds for flow shops with multiple processors[J].European Journal of Operational Research, 1995, 80:112-120. 被引量:1
  • 8李霄峰,邵惠鹤,任德祥.求解混合Flow shop调度问题的简化禁忌搜索方案[J].上海交通大学学报,2003,37(4):516-519. 被引量:4

共引文献10

同被引文献55

引证文献5

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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