Embedding simulation in yard crane dispatching to minimize job tardiness in container terminals
Two optimal algorithms, MTA* and MT-RBA*, are presented to find the optimal yard crane (YC) job sequence for serving a fleet of vehicles for delivery and pickup jobs with scheduled deadlines and predicted vehicle arrival times. The objective is to minimize the total tardiness of incoming vehicle job...
Main Authors: | Huang, Shell Ying, Guo, Xi, Hsu, Wen Jing, Lim, Wei Lin |
---|---|
Outros autores: | School of Computer Engineering |
Formato: | Conference Paper |
Idioma: | English |
Publicado: |
2013
|
Subjects: | |
Acceso en liña: | https://hdl.handle.net/10356/99035 http://hdl.handle.net/10220/12795 |
Títulos similares
-
Yard crane dispatching to minimize job tardiness in container terminals
por: Lim, Wei Lin.
Publicado: (2012) -
Yard crane dispatching to minimize maximum tardiness of the jobs
por: Wan, Zhi Yong
Publicado: (2014) -
Handling arrival time uncertainties in yard crane dispatching to minimize job tardiness in container terminals
por: Li, Iemin
Publicado: (2014) -
Handling arrival time uncertainties in yard crane dispatching to minimize job tardiness in container terminals
por: Seah, Sheng Kiat
Publicado: (2015) -
Performing A* search for yard crane dispatching in container terminals
por: Guo, Xi, et al.
Publicado: (2011)