ON-LINE SCHEDULING OF EMPTY CONTAINERS

Lele Zhang () and Andrew Wirth ()
Additional contact information
Lele Zhang: School of Mathematical Sciences, Monash University, VIC 3800, Australia
Andrew Wirth: Department of Mechanical Engineering, The University of Melbourne, VIC 3010, Australia

Asia-Pacific Journal of Operational Research (APJOR), 2012, vol. 29, issue 04, 1-19

Abstract: This paper considers the empty container repositioning problem in an on-line scheduling setting. This optimization problem arising from container transportation management aims to balance empty containers distribution among transportation sites so as to minimize the total operating cost of loaded container shipping, empty container allocation and leasing. In this highly uncertain on-line environment we introduce a heuristic that does not attempt to balance the empty container distribution, and evaluate its competitive performance mathematically and empirically.

Keywords: On-line scheduling; empty containers (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595912500182
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:29:y:2012:i:04:n:s0217595912500182

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595912500182

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().