Scheduling of container storage and retrieval

Operations Research

Volumn 57, Issue 2, 2009, Pages 456-467

  Vis, Iris F A ^a   Roodbergen, Kees Jan ^b  

^a VU University   (Netherlands)

^b ERASMUS UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE NETWORKS; CONTAINER TERMINALS; DIRECTED NETWORKS; OPTIMAL ASSIGNMENTS; OPTIMALITY; RURAL POSTMAN PROBLEMS; STORAGE AND RETRIEVALS; STORAGE AREAS;

CONTAINERS; SCHEDULING; SYSTEMS ENGINEERING; UNMANNED AERIAL VEHICLES (UAV);

TRAVELING SALESMAN PROBLEM;

EID: 65349108107     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1080.0621     Document Type: Article

References (19)

1. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows, Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ.
2. Arunapuram, S., K. Mathur, D. Solow. 2003. Vehicle routing and scheduling with full truckloads. Transportation Set 37(2) 170-182.
3. Bodin, L., A. Mingozzi, R. Baldaeci, M. Ball. 2000. The rollon-rolloff vehicle routing problem. Transportation Sci. 34(3) 271-288.
4. Burkard, R. E., V. G. Deineko, R. Van Dal, J. A. A. Van Der Veen, G. J. Woeginger. 1998. Well-solvable special cases of the traveling salesman problem: A survey. SIAM Rev. 40(3) 496-546.
5. Cornuéjols, G., J. Fonlupt, D. Naddef. 1985. The traveling salesman problem on a graph and some related integer polyhedra. Math. Programming 33 1-27.
6. De Koster, M. B. M., T. Le-Anh, J. R. Van Der Meer. 2004. Testing and classifying vehicle dispatching rules in three real-world settings. J. Oper. Management 22(4) 369-386.
7. De Meulemeester, L., G. Laporte, F. V. Louveaux, F. Semet. 1997. Optimal sequencing of skip collections and deliveries. /. Oper. Res. Soc. 48(1) 57-64.
8. Han, M. H., L. F. McGinnis, J. S. Shieh, J. A. White. 1987. On sequencing retrievals in an automated storage/retrieval system. HE Trans. 19(1) 56-66.
9. Kim, K. H., K. Y. Kim. 1999a. Routing straddle carriers for the loading operation of containers using a beam search algoridim. Comput. Indust. Engrg. 36 109-136.
10. Kim, K. H., K. Y. Kim. 1999b. An optimal routing algorithm for a transfer crane in port container terminals. Transportation Sci. 33(1) 17-33.
11. Kim, K. H., K. M. Lee, H. Hwang. 2003. Sequencing delivery and receiving operations for yard cranes in port container terminals. Internat. J. Production Econom. 84 283-292.
12. Law, A. M., W. D. Kelton. 2000. Simulation Modeling and Analysis. 3rd ed. McGraw-Hill, New York.
13. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys. 1985. The Traveling Salesman Ptoblem, a Guided Tour of Combinatorial Optimization. John Wiley & Sons, Chichester, UK.
14. Lenstra, J. K., A. H. G. Rinnooy Kan. 1976. On general routing problems. Networks 6 273-280.
15. Papadimitriou, C. H., K. Steiglitz. 1982. Combinatorial Optimization, Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ.
16. Ratliff, H. D., A. S. Rosenthal. 1983. Order picking in a rectangular warehouse: A solvable case of the traveling salesman problem. Oper. Res. 31(3) 507-521.
17. Saanen, Y. A. 2004. An approach for designing robotized marine container terminals. Ph.D. thesis, Technical University Delft, Delft, The Netherlands.
18. Van Den Berg, J. P., A. J. R. M. Gademann. 1999. Optimal routing in an automated storage/retrieval system with dedicated storage. HE Trans. 31 407-415.
19. Wolsey, L. A. 1998. Integer Programming. John Wiley & Sons, New York.