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:
主要作者: | Low, Yihang. |
---|---|
其他作者: | Huang Shell Ying |
格式: | Final Year Project |
語言: | English |
出版: |
2012
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/48639 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
A heuristic algorithm to schedule twin yard crane to Mmnimize job tardiness in container terminals
由: Chua, Jason Zhen Sheng
出版: (2014) -
A heuristic algorithm for yard crane dispatching in container terminals
由: Lee, Zhen Jie
出版: (2014) -
Yard crane dispatching to minimize maximum tardiness of the jobs
由: Wan, Zhi Yong
出版: (2014) -
Reducing simulation costs in embedded simulation in yard crane dispatching in container terminals
由: Ong, Yi Long.
出版: (2013) -
Hybrid evolutionary algorithm for multi-mode resource-constrained project scheduling problem
由: Marshal, Brian.
出版: (2011)