期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

钢卷仓库中的吊机调度问题 被引量：2

Crane Scheduling in Warehouse of Coil
下载PDF
导出
摘要 研究了钢铁企业冷轧原料库中的吊机调度问题.将吊机的运输和倒垛操作集成考虑,目标函数为将全部需求板卷运输到指定位置的时间最小化.对于该问题,首先提出了一个混合整规划模型,进一步证明了该问题是强NP难的.基于对问题性质的分析,针对无倒垛操作的特殊情况,提出了多项式时间可解的最优算法.对于问题的一般情况,提出了一个启发式算法并分析了它的最坏情况. The crane scheduling problem which is motivated by cooled-rolling material warehouse in iron and steel enterprise is studied. Considering the transportation and shifting simultaneously, the objective function is to minimize the time of transporting all demand coils to a specified location. For this problem, a mixed integer programming model is proposed, which further proofs that the problem is strongly NP-hard. Based on some analytical properties, a polynomial-time optimal algorithmis proposed for solving a special case that no shuffling operation happens, and furthermore a heuristic algorithm is developed for solving general case, respectively. The performance is analyzed from worst-case point of view.
作者 谢谢 李彦平
机构地区 沈阳大学装备制造综合自动化重点实验室
出处 《沈阳大学学报（自然科学版）》 CAS 2014年第2期159-165,共7页 Journal of Shenyang University：Natural Science
基金 国家自然科学基金资助项目(71201104)
关键词 吊机调度 仓库 强NP难 启发式 最坏情况分析 crane scheduling warehouse strongly NP-hard heuristics worst-case analysis
分类号 TG156.2 [金属学及工艺—热处理]
  • 相关文献

参考文献13

  • 1van den Berg J P, Zijm W H M. Models for Warehouse Management: Classification and Examples [- J 7. International Journal of Production Economics, 1999, 59 (1/2/3) : 519 - 528.
  • 2Z/ipfel G, Wasner M. Warehouse Sequencing in the Steel Supply Chain as a Generalized Job Shop Model [-J 7. International Journal of Production Economics, 2006,104(2):482 - 501.
  • 3Burkard R E, Fruhwirth B, Rote G. Vehicle Routing in an Automated Warehouse: Analysis and Optimization[J]. Annals of Operations Research, 1995,57(1):29- 44.
  • 4van den Berg J P. Planning and Control of Warehousing Systems[D]. Enschede: University of Twente, 1996.
  • 5van den Berg J P. A Literature Survey on Planning and Control of Warehousing Systems [J]. IIE Transactions, 1999,31(8) .-751 - 762.
  • 6Bertazzi L, Speranza M G. Minimizing Logistic Costs in Multistage Supply Chains[J]. Naval Research Logistics, 1999,46(4) ..399 - 417.
  • 7Kim K H, Hong G P. A Heuristic Rule for Relocating Blocks[J]. Computers Operations Research, 2006,33 (4) :940 - 954.
  • 8Wan Y W, Liu Jiyin, Tsai P C. The Assignment of Storage Locations to Containers for a Container Stack[J]. Naval Research Logistics, 2009,56(8) :699 - 713.
  • 9Lee Yusin, Lee Y J. A Heuristic for Retrieving Containers from a Yard[J]. Computers & Operations Research, 2010,37(6) : 1139 - 1147.
  • 10Lee Yusin, Hsu N Y. An Optimization Model for the Container Pre-marshalling Problem [J] Computers & Operations Research, 2007,34(1) :3295 - 3313.

二级参考文献13

  • 1Jiyin Liu,Yun Jiang,Zhili Zhou.Cyclic scheduling of a single hoist in extended electroplating lines: a comprehensive integer programming solution[J].IIE Transactions.2002(10)
  • 2Y. Crama,V. Kats,J. van de Klundert,E. Levner.Cyclic scheduling in robotic flowshops[J].Annals of Operations Research (-).2000(1-4)
  • 3Chung-Yee Lee,Lei Lei,Michael Pinedo.Current trends in deterministic scheduling[J].Annals of Operations Research.1997(0)
  • 4Ebru K,Bish.A multiple-crane-constrained scheduling problem in a container terminal[].European Journal of Operational Research.2003
  • 5Moon S,Hrymak A N.Scheduling of the batch annealing process-deterministic case[].Computers and Chemistry.1999
  • 6Ng WC.Crane schedulingin container yards withinter-craneinterference[].European Journal of Operational Research.2005
  • 7LIU J,JIANG Y.An efficient optimal solution to the two-hoist no-wait cyclic scheduling problem[].Operations Research.2005
  • 8N.G. Hall,H. Kamoun,C. Sriskandarajah.Scheduling in Robotic Cells, Complexity and Sready State Analysis[].European Journal of Operational Research.1998
  • 9Liu J,Wan Y-w,Wang L.Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures[].Naval Res Logistics.2006
  • 10Moccia L,Cordeau J,Gaudioso M,et al.A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal[].Naval Research Logistics.2006

共引文献3

同被引文献14

  • 1邵举平,高岚.钢卷库行车定位精度确定的方法[J].冶金设备,2004(5):32-34. 被引量：5
  • 2Guan Y, Cheung R K. The Berth Allocation Problem: Models and Solution Methods[J]. OR Spectrum, 2004,26 (1):75-92.
  • 3Imai A, Sun X, Nishimura E, et al. Berth Allocation in a Container Port: Using a Continuous Location Space Approach [J]. Transportation Research Part B.- Methodological, 2005,39(3) : 199 - 221.
  • 4Park Y M, Kim K H. A Scheduling Method for Berth and Quay Cranes[J]. OR Spectrum, 2003,25(1) : 1 - 23.
  • 5Kim K H, Moon K C. Berth Scheduling by Simulated Annealing[J]. Transportation Research Part B: Methodological, 2003,37(6) : 541 - 560.
  • 6Neumann K, Zimmermann J. Procedures for Resource Leveling and Net Present Value Problems in Project Scheduling with General Temporal and Resource Constraints [J]. European Journal of Operational Research, 2000,127(2) : 425 - 443.
  • 7Lei L, Wang T J. The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints[J]. Management Science, 1991,37(12) : 1629 - 1639.
  • 8Armstrong R, Gu S, Lei L. A Greedy Algorithm to Determine the Number of Transporters in a Cyclic Eleetroplating Process [J]. IIE Transactions, 1996, 28 (5) :347- 355.
  • 9Liu J Y, Jiang Y. An Efficient Optimal Solution to the Two-hoist No-wait Cyclic Scheduling Problem [ J ]. Operations Research, 2005,53(2) : 313 - 327.
  • 10Zhou Z L, Liu J Y. A Heuristic Algorithm for the Tw(> hoist Cyclic Scheduling Problem with Overlapping Hoist Coverage Ranges [J]. liE Transactions, 2008, 40 (8) :782 - 794.

引证文献2

二级引证文献9

沈阳大学学报（自然科学版）
2014年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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