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...
محفوظ في:
المؤلف الرئيسي: | Low, Yihang. |
---|---|
مؤلفون آخرون: | Huang Shell Ying |
التنسيق: | Final Year Project |
اللغة: | English |
منشور في: |
2012
|
الموضوعات: | |
الوصول للمادة أونلاين: | http://hdl.handle.net/10356/48639 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
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)