Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/74234
Title: Load scheduling of multiple yard crane systems in container terminal with buffer areas
Authors: Cao, Z.
Lee, D.-H. 
Meng, Q. 
Keywords: Buffer area
Multiple yard crane system
Scheduling
Issue Date: 2006
Source: Cao, Z.,Lee, D.-H.,Meng, Q. (2006). Load scheduling of multiple yard crane systems in container terminal with buffer areas. 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 : 1486-1498. ScholarBank@NUS Repository.
Abstract: This paper addresses the load scheduling problem of multiple yard crane systems in container terminals with buffer areas. In the problem, several yard cranes are used to pick up a sequence of containers for a quay crane. The containers picked up ahead of the schedule can be stored at buffer areas until they can be handled by the quay crane. An integer programming model is developed for the problem formulation. In the model, the work schedules of different yard cranes are decided simultaneously to minimize the loading time. It is noted that the yard crane scheduling problem is NPcomplete by nature. Therefore a scheduling heuristic is designed to solve the proposed problem. Numerical examples are conducted to compare the performances of the multiple yard crane systems in container terminals with and without buffer areas.
Source Title: 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006
URI: http://scholarbank.nus.edu.sg/handle/10635/74234
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

43
checked on Dec 9, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.