Please use this identifier to cite or link to this item:
Choi, Byung-Cheon
Briskorn, Dirk
Lee, Kangbok
Leung, Joseph
Pinedo, Michael
Year of Publication: 
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 641
Universität Kiel, Institut für Betriebswirtschaftslehre, Kiel
We consider the problem of allocating containers to ships in which the size of container is 1 or 2, and each ship has its own capacity and fixed departure time. The fixed departure times implies the completion times of containers belonging to the same ship are identical. As objectives, Lmax, ∑wjCj, ∑wjUj and ∑Tj are considered. We verify the problems are closely related with the scheduling problem with eligibility constraint or the generalized assignment problem. The polynomial-time algorithms are developed for each problem, and moreover the more efficient algorithms are presented for the cases with ∑Cj and ∑Uj,
Container Allocation
Fixed Departure Time
Document Type: 
Working Paper

Files in This Item:

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