Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/62890
Title: | A heuristic algorithm to schedule twin yard crane to minimize job tardiness in container terminals | Authors: | Wee, Benathon Yan Zhi | Keywords: | DRNTU::Engineering::Computer science and engineering::Data::Data structures DRNTU::Engineering::Computer science and engineering::Mathematics of computing::Numerical analysis |
Issue Date: | 2015 | Abstract: | This project aims to reduce the job tardiness in container terminals. By implementing earliest deadline first algorithm in the Rubber Tyred Gantry (RTG) system, we hope to improve the current algorithm with additional method call look ahead. The main thing that look ahead does is to consider other unassigned job as well. From this project, it shows how this algorithm and the additional method are implemented and included test cases that prove the additional function is working correctly. It also shows that by including the additional function, it improves job tardiness for most of the cases as factors such as the safety distance between the two yard cranes also play a significant role. | URI: | http://hdl.handle.net/10356/62890 | Schools: | School of Computer Engineering | Rights: | Nanyang Technological University | Fulltext Permission: | restricted | Fulltext Availability: | With Fulltext |
Appears in Collections: | SCSE Student Reports (FYP/IA/PA/PI) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
SCE14-0157 Benathon Wee Yan Zhi U1222243D FYP Report Amended.pdf Restricted Access | 1.18 MB | Adobe PDF | View/Open |
Page view(s)
418
Updated on Mar 15, 2025
Download(s)
7
Updated on Mar 15, 2025
Google ScholarTM
Check
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.