On-line scheduling of empty containers

DOI10.1142/S0217595912500182MaRDI QIDQ2920363zbMATH OpenFDO

Authors Lele Zhang, Andrew Wirth

Publication date 16 October 2012

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0217595912500182

zbMATH Keywords

empty containerson-line scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Allocation of empty containers between multi-ports
• An algorithm with performance guarantee for the online container relocation problem
• An optimization model for container inventory management
• A recursive model for static empty container allocation
• Empty container management in a port with long-run average criterion

Cites work

• A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem
• Dynamic and Stochastic Models for the Allocation of Empty Containers

Cited in

(6)

• Online and offline container purchasing and repositioning problem
• Empty container management in a port with long-run average criterion
• Online storage systems and transportation problems with applications. Optimization models and mathematical solutions.
• A recursive model for static empty container allocation
• Allocation of empty containers between multi-ports
• Positioning empty containers among multiple ports with leasing and purchasing considerations

This page was built for publication: On-line scheduling of empty containers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920363)