A heuristic method for online warehouse storage assignment problem

Proceedings of 2008 IEEE International Conference on Service Operations and Logistics, and Informatics, IEEE/SOLI 2008

Volumn 2, Issue , 2008, Pages 1897-1902

  Xu, Jing ^a   Lim, Andrew ^a   Shen, Chenghao ^b   Li, Huangwei ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Facility location; Online problem; Warehouse storage

Indexed keywords

DATA STORAGE EQUIPMENT; FACILITIES; HEURISTIC ALGORITHMS; MILITARY OPERATIONS; PLANNING; PORTALS; RESOURCE ALLOCATION; TRAVELING SALESMAN PROBLEM; WAREHOUSES;

CURRENT PRACTICES; DETERMINISTIC APPROACHES; FACILITY LOCATION; FEASIBLE SOLUTIONS; GENERAL VERSIONS; ONLINE PROBLEM; OPTIMAL SOLUTIONS; STOCHASTIC RESOURCES; STORAGE ASSIGNMENTS; STORAGE LOCATIONS; TIME HORIZONS;

HEURISTIC METHODS;

EID: 58049165333     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SOLI.2008.4682840     Document Type: Conference Paper

References (10)

1. W. H. Hausman, L. B. Schwarz, and S. C. Graves, "Optimal storage assignment in automatic warehousing systems." Management Science, vol. 22, no. 6, pp. 629-638, 1976.
2. M. Goetschalckx and H. D. Ratliff, "Shared storage policies based on the duration stay of unit loads." Management Science, vol. 36, no. 9, pp. 1120-1132, 1990.
3. T. Szkaliczki, "Routing with minimum wire length in the dogleg-free manhattan model is np-complete." SIAM J. Comput., vol. 29, no. 1, pp. 274-287, 1999.
4. D. Marx, "A short proof of the NP-completeness of minimum sum interval coloring," Oper. Res. Lett., vol. 33, no. 4, pp. 382-384, 2005.
5. L. G. Kroon, A. Sen, H. Deng, and A. Roy, "The optimal cost chromatic partition problem for trees and interval graphs." in WG, 1996, pp. 279-292.
6. S. Nicoloso, M. Sarrafzadeh, and X. Song, "On the sum coloring problem on interval graphs." Algorithmica, vol. 23, no. 2, pp. 109-126, 1999.
7. M. M. Halldórsson, G. Kortsarz, and H. Shachnai, "Sum coloring interval and k-claw free graphs with application to scheduling dependent jobs." Algorithmica, vol. 37, no. 3, pp. 187-209, 2003.
8. -, "Minimizing average completion of dedicated tasks and interval graphs." in RANDOM-APPROX, 2001, pp. 114-126.
9. K. Jansen, "Approximation results for the optimum cost chromatic partition problem." J. Algorithms, vol. 34, no. 1, pp. 54-89, 2000.
10. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, second edition ed. The MIT Press and McGraw-Hill Book Company, 2001.