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...
| Hlavní autoři: | , |
|---|---|
| Další autoři: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydáno: |
2018
|
| Témata: | |
| On-line přístup: | https://hdl.handle.net/10356/89771 http://hdl.handle.net/10220/46732 |