期刊文献+

平行机作业环境下的订单分配与排序 被引量:4

Order Assignment and Scheduling with Parallel Machines
下载PDF
导出
摘要 针对一类平行机作业环境下的订单分配与排序问题,从整体的角度协同优化供应链中的订单分配、生产调度和分批运输调度。以完成所有订单的总订货提前期与生产运输总成本的加权和最小化为目标,构建了问题的数学模型。将基于向量组编码结构的禁忌搜索算法与基于动态规划方法的启发式算法相结合,设计了一种混合优化算法以求解问题。对不同策略和不同算法进行比较,数据实验结果显示了订单分配与排序策略的优越性及所提算法的有效性。 An order assignment and scheduling problem with parallel machines is studied. Deci- sions of different functions including order assignment, production scheduling and batch delivery scheduling are integrated for a simultaneous optimization in the supply chain. A mathematical model for the problem is built to minimize a weight sum of the total lead time and total cost. A hybrid algo- rithm which integrates a tabu search algorithm with vector array representation and a heuristic algo- rithm based on dynamic programming method is designed to solve the problem. Experiments adopting different approaches and algorithms are conducted on the problem; the results verify the substantial advantage of the order assignment and scheduling approach and confirm that the designed hybrid algo- rithm is an efficient method for solving the problem.
作者 蒋大奎 李波
出处 《管理学报》 CSSCI 北大核心 2013年第6期919-924,共6页 Chinese Journal of Management
基金 教育部新世纪优秀人才支持计划资助项目(NCET-06-0236) 教育部高等学校博士学科点专项科研基金资助项目(20100032110034)
关键词 供应链排序 平行机 禁忌搜索 动态规划 supply chain scheduling parallel machines tabu search dynamic programming
  • 相关文献

参考文献13

  • 1CHEN Z L, PUNDOOR G. Order Assignment and Scheduling in a Supply Chain [J]. Operations Re- search, 2006, 54 (3) :555-572.
  • 2LI C L, OU J W. Coordinated Scheduling of Custom-er Orders with Decentralized Machine Locations[J]. IIE Trans,2007, 39(9) :899-909.
  • 3柏孟卓,唐国春.与交货期有关的供应链排序问题[J].运筹学学报,2009,13(1):113-119. 被引量:14
  • 4蒋大奎,李波.基于混合禁忌搜索算法的供应链排序问题[J].机械工程学报,2011,47(20):53-59. 被引量:20
  • 5CHEN Z L. Integrated Production and Outbound Distribution Scheduling: Review and Extensions[J]. Operations Research, 2010, 58(1) :130-148.
  • 6CHANG Y C, LEE C Y. Machine Scheduling with Job Delivery Coordination [J]. European Journal of Operational Research, 2004,158(2) :470-487.
  • 7HALL N G, POTTS C N. The Coordination of Scheduling and Batch Deliveries[J]. Annual of Oper- ations Research,2005,135(1) :41-64.
  • 8CHEN Z L, VAIRAKTARAKIS G L. Integrated Scheduling of Production and Distribution Operations [J]. Management Science, 2005, 51(4):614-628.
  • 9ZHONG W, DOSA G, TAN Z. On the Machine Scheduling Problem with Job Delivery Coordination [J]. European Journal of Operational Research,2007,182(3):1 057-1 072.
  • 10陈荣军,唐国春.平行机的供应链排序[J].系统科学与数学,2010,30(2):274-282. 被引量:10

二级参考文献41

共引文献142

同被引文献38

  • 1陈荣军,唐国春.同类机的供应链排序[J].系统工程学报,2010,25(1):62-67. 被引量:14
  • 2Robert M. Scheduling with Deadlines and Loss Functions[J]. Management Science, 1959,6(1) : 1-12.
  • 3Graham R L. Bounds for certain multiprocessing anomalies [J]. The Bell System Technical Journal, 1966,45 : 1563-1581.
  • 4Graham R L. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 1969,17(2) :416-429.
  • 5Zhao C L,Ji M, Tang H Y. Parallel-machine scheduling with an availability constraint [J]. Computers ~ Industrial Engineering, 2011,61 (3) : 778-781.
  • 6Moradi E, Zandieh M. Minimizing the makespan and the system unavailability in parallel machine scheduling problem~a similarity-based genetic algorithm[J]. International Journal of Advanced Manufacturing Technology, 2010,51(5) : 829-840.
  • 7Ji M,Cheng T C E. Parallel-machine scheduling with simple linear deterioration to minimize total completion time [-J 1. European Journal of Operational Research, 2008,188 (2) : 342-347.
  • 8Wang Z B, Cui Z H. Combination of parallel machine scheduling and vertex cover [J~. Theoretical Computer Science, 2012, 460 10-15.
  • 9Brucker P,Shakhlevich N V. Inverse scheduling: two-machine flow-shop problem[J]. Journal of Scheduling,2011,14(3) ~239- 256.
  • 10Wang Z B,Xing W X. Worst-case analysis for on-line service policies[J]. Journal of Combinatorial Optimization, 2010, 19 (1) :107-122.

引证文献4

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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