Scheduling of Container Storage and Retrieval

Iris F. A. Vis () and Kees Jan Roodbergen ()
Additional contact information
Iris F. A. Vis: Faculty of Economics and Business Administration, VU University Amsterdam, 1081 HV Amsterdam, The Netherlands
Kees Jan Roodbergen: Rotterdam School of Management, Erasmus University, 3000 DR Rotterdam, The Netherlands

Operations Research, 2009, vol. 57, issue 2, 456-467

Abstract: We consider the problem of scheduling the storage and retrieval of containers in the storage area of a container terminal. Some arcs in the underlying directed network must be visited; other arcs may be---but need not be---visited. We can, therefore, consider this problem to be a special case of the directed rural postman problem. We show that this problem can be reformulated as an asymmetric Steiner traveling salesman problem. This reformulation can be efficiently solved to optimality by a combination of optimal assignments in bipartite networks for parts of the problem and dynamic programming for the connections between those parts.

Keywords: transportation; freight/materials handling; facilities/equipment planning; scheduling (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (27)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1080.0621 (application/pdf)

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:inm:oropre:v:57:y:2009:i:2:p:456-467

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().