Allocating containers to ships with fixed departure times

Arbeitspapier

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,

Object Details

• Language: Englisch

References and Relationships

• Bibliographic citation: Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; No. 641

Classification and Topics

• Classification: Management
• Subject: Scheduling ; Container Allocation ; Fixed Departure Time ; Containerschifffahrt ; Linienverkehr ; Scheduling-Verfahren ; Transportproblem

Contributors, Places and Time

• Event: Geistige Schöpfung
• (who): Choi, Byung-Cheon ; Briskorn, Dirk ; Lee, Kangbok ; Leung, Joseph ; Pinedo, Michael
• Event: Veröffentlichung
• (who): Universität Kiel, Institut für Betriebswirtschaftslehre
• (where): Kiel
• (when): 2008

Further information

• Handle: http://hdl.handle.net/10419/147559
• Last update: 10.03.2025, 11:41 AM CET