Approximate the scheduling of quay cranes with non-crossing constraints
Year of publication: |
1 May 2017
|
---|---|
Authors: | Zhang, An ; Zhang, Wenshuai ; Chen, Yong ; Chen, Guangting ; Chen, Xufeng |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 258.2017, 3 (1.5.), p. 820-828
|
Subject: | Scheduling | Non-crossing | Quay cranes | Approximation algorithms | Worst case analysis | Scheduling-Verfahren | Scheduling problem | Kran | Crane | Theorie | Theory | Algorithmus | Algorithm | Containerterminal | Container terminal | Mathematische Optimierung | Mathematical programming |
-
Optimal algorithm for the general quay crane double-cycling problem
Lee, Chung-Yee, (2015)
-
Optimal berth allocation and time-invariant quay crane assignment in container terminals
Türkoğullariı, Yavuz B., (2014)
-
A robust optimization approach to the integrated berth allocation and quay crane assignment problem
Shang, Xiao Ting, (2016)
- More ...
-
Chen, Yong, (2021)
-
Parallel machines scheduling with machine maintenance for minsum criteria
Tan, Zhiyi, (2011)
-
A new three-machine shop scheduling : complexity and approximation algorithm
Dong, Jianming, (2013)
- More ...