A bounded two-level dynamic programming algorithm for quay crane scheduling in container terminals
One of the optimization problems in terminal operations is the quay crane scheduling problem. The quay crane scheduling algorithm plays a critical role because it directly affects the length of the vessel loading and unloading process, which means vessel turnaround time. We propose a bounded two-lev...
Saved in:
Main Authors: | Huang, Shell Ying, Li, Ya |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/89771 http://hdl.handle.net/10220/46732 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
An approximation algorithm for quay crane scheduling with handling priority in port container terminals
by: Lee, D.-H., et al.
Published: (2014) -
Examination of the effectiveness and robustness of the heuristics for bay-based quay crane scheduling problem in port container terminals
by: Chen, J.H., et al.
Published: (2014) -
Quay crane scheduling with handling priority in port container terminals
by: Lee, D.-H., et al.
Published: (2014) -
Quay crane scheduling with non-interference constraints in port container terminals
by: Lee, D.-H., et al.
Published: (2014) -
Quay crane scheduling with non-crossing and safety distance constraints in port container terminals
by: Wang, H.Q., et al.
Published: (2014)