Scheduling of Container Storage and Retrieval

References

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