排序方式: 共有124条查询结果,搜索用时 15 毫秒
91.
92.
Frank Meisel 《海军后勤学研究》2011,58(7):619-636
The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time windows. The problem is of practical relevance, because container terminal operators frequently redeploy cranes among vessels to speed up the service of high‐priority vessels while serving low‐priority vessels casually. This article provides a mathematical formulation of the problem and a tree‐search‐based heuristic solution method. A computational investigation on a large set of test instances is used to evaluate the performance of the heuristic and to identify the impact of differently structured crane time windows on the achievable vessel handling time. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
93.
马千里 《武警工程学院学报》2011,(2):4-5
研究六角形石墨烯纳米结构的量子输运性质,利用基于紧束缚近似的非平衡格林函数方法计算得到体系的透射系数。由于透射率强烈地依赖于所研究区域的结构,可以看到,体系的透射率随电子能量变化发生剧烈的扰动,并得到了一些有用的结论,并且我们认为,这些结论对于未来的纳米器件设计具有指导意义。 相似文献
94.
95.
2010年美国弹道导弹防御系统发展发生重大变化。从导弹防御发展策略入手,总结略有不同的一体化导弹防御系统建设进展,并结合一年来美国导弹防御系统发展动向,分析未来导弹防御系统的发展趋势。 相似文献
96.
97.
98.
The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
99.
100.
用解析的方法建立了节矩法测量火炮身管弯曲度的数学模型,讨论了模型的可解性。并验证了模型的正确性。 相似文献