Comparison of yard crane scheduling algorithms
Yard cranes (YCs) are integral parts of a container terminal system. It is desirable to find algorithms which can produce an optimal sequence for a set of jobs to be served by yard crane. This problem of yard crane scheduling has been widely studied and various algorithms have been developed. This p...
Saved in:
Main Author: | Low, Yihang. |
---|---|
Other Authors: | Huang Shell Ying |
Format: | Final Year Project |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/48639 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
A heuristic algorithm to schedule twin yard crane to Mmnimize job tardiness in container terminals
by: Chua, Jason Zhen Sheng
Published: (2014) -
A heuristic algorithm for yard crane dispatching in container terminals
by: Lee, Zhen Jie
Published: (2014) -
Yard crane dispatching to minimize maximum tardiness of the jobs
by: Wan, Zhi Yong
Published: (2014) -
Reducing simulation costs in embedded simulation in yard crane dispatching in container terminals
by: Ong, Yi Long.
Published: (2013) -
Hybrid evolutionary algorithm for multi-mode resource-constrained project scheduling problem
by: Marshal, Brian.
Published: (2011)