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

带有安全距离约束的无交叉岸桥调度问题 被引量：1

Quay Crane Scheduling with Non-crossing Constraints and Safety Margins
下载PDF
导出
摘要 研究了带有安全距离约束的无交叉岸桥调度问题。其中,安全距离指相邻岸桥同时作业时必须间隔一定数量的船舱,目标是极小化轮船的装卸时间。并对岸桥带有1个船舱安全距离的2台和3台情景设计了调度算法,并证明了算法的最坏情况界分别为4/3和3/2。 This paper investigates quay cranes(QCs)scheduling with both non-crossing constraints and safety margins between QCs,where a safety margin signifies a certain number of in-between holds between adjacent QCs.The goal is to minimize the overall loading or unloading time of a vessel.Approximation algorithms are designed for two and three QCs with one-hold safety margins,where the worst case ratios are proven to be 4/3 and 3/2 respectively.
作者 宣鑫乐 张安 陈永 陈光亭 XUAN Xinle;ZHANG An;CHEN Yong;CHEN Guangting(School of Science,Hangzhou Dianzi University,Hangzhou Zhejiang 310018,China)
机构地区 杭州电子科技大学理学院
出处 《杭州电子科技大学学报（自然科学版）》 2018年第2期89-92,共4页 Journal of Hangzhou Dianzi University：Natural Sciences
基金 国家自然科学基金资助项目(11571252 11401149) 浙江省自然科学基金资助项目(LY16A010015)
关键词 安全距离 无交叉作业 周度 近似算法 最坏情况分析 safety margins non-crossing constraints scheduling approximation algorithm worst-case analysis
分类号 O221.7 [理学—运筹学与控制论]
  • 相关文献

参考文献1

二级参考文献13

  • 1Lim A, Rodrigues B, Xu Zhou. A m-parallel crane scheduling problem with a non-crossing constraint [J]. Naval research logistics, 2007, 54(2): 115-127.
  • 2Lee D H, Wang Huiqiu, Miao Lixin. An approximation algorithm for quay crane scheduling with non-interference constraints in port container terminals[R]. Technical Report, presented at Tristan VI, Phuket, June 10-15, 2007.
  • 3Lee D H, Wang Huiqiu, Miao Lixin. Quay crane scheduling with non-interference constraints in port container terminals[J]. Transportation Research Part E: Logistics and Transportation Review, 2008, 44(1): 124-135.
  • 4Lee D H, Chen Jianghang. An improved approach for quay crane scheduling with non- crossing constraints [J]. Engineering Optimization, 2010, 42(1): 1-15.
  • 5Cuan Yongpei, Yang K H, Zhou Zhili. The crane scheduling problem: models and solution approaches [J]. Annals of Operations Research, 2013, 203(1): 119-139.
  • 6Lim A, Rodrigues B, Xu Zhou. Approximation schemes for the crane scheduling problem [A]. In: Hagerup T, Katajainen J, eds, 9th Scandinavian workshop on algorithm theory (SWAT 2004)[C]. Lecture notes in computer science, vol. 3111, 2004, 323-335.
  • 7Liu Ming, Zheng Feifeng, Li Jinfeng. Scheduling small number of quay cranes with non- interference constraint [J]. Optimization Letters, 2015, 9(2): 403-412.
  • 8Fu Yimin, Diabat A. A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem[J]. Applied Mathematical Modelling, 2015, 39(3): 1194-1201.
  • 9Goodchild A V, Daganzo C F. Double-cycling strategies for container ships and their effect on ship loading and unloading operations[J]. Transportation Science, 2006, 40(4): 473-483.
  • 10Goodchild A V, Daganzo C F. Crane double cycling in container ports: planning methods and evaluation[J]. Transportation Research Part B: Methodological, 2007, 41(8): 875-891.

共引文献1

同被引文献4

引证文献1

二级引证文献1

杭州电子科技大学学报（自然科学版）
2018年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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