期刊文献+

在阶跃式定购成本函数和运输能力限制下的运输船只排序问题 被引量:1

Scheduling Ships with Multiple Setup Cost and Capacity Constraints
下载PDF
导出
摘要 本文考虑短时期内,满足确定需求,不能缺货,有运输能力限制,且定购成本函数为阶跃型的运输船只排序问题,分析了最优解性质,并据此提出了相应的算法,算法复杂度为O(T3),并给出了算法的应用实例.最后,指出了未来研究的方向.
出处 《中国管理科学》 CSSCI 2004年第z1期10-13,共4页 Chinese Journal of Management Science
  • 相关文献

参考文献6

  • 1[1]Alp, O. , et al. Optimal lot - sizing/vehicle - dispatching policies under stochastic lead times and stepwise fixed costs[ J]. Operations Research ,2003,51 ( 1 ): 160 - 166.
  • 2[2]Florian, M. , M. Klein. Deterministic production planning with concave costs and capacity constraints [ J ]. Management Science,1971,18(1) :12 -20.
  • 3[3]Lee, C. - Y. A dynamic model for inventory lot sizing and outbound shipment schedul - ing at a third -party warehouse[ J]. Operations Research,2003,51 (5) :735 - 747.
  • 4[4]Lippman, S. A. Optimal inventory policy with multiple setup costs[J]. Management Science, 1969,16 ( 1 ): 118 - 138.
  • 5[5]Lippman, S. A. Economic order quantities and multiple setups[ J].Management Science,1971,18( 1 ) :39 -47.
  • 6[6]Yano, C. A. , A. M. Newman. Scheduling trains and containers with due dates and dynamic arrivals [ J ]. Transportation Science,2001,35(2) :181 - 191.

同被引文献28

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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