A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints

INFORMS Journal on Computing

Volumn 19, Issue 1, 2007, Pages 14-26

  Ahuja, Ravindra K ^a   Huang, Wei ^b   Romeijn, H Edwin ^a   Morales, Dolores Romero ^c  

^a University of Florida   (United States)

^b Gainesville Technology Enterprise Center (GTEC)   (United States)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Capacity constraints; Heuristics; Production and inventory planning

Indexed keywords

EID: 61349162332     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1050.0151     Document Type: Article

References (29)

1. Ahuja, R. K., N. Bofand, I. Dumitrescu. 2001a. Exact and heuristic algorithms for the subset disjoint minimum cost cycle problem. Working paper, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL.
2. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ.
3. Ahuja, R. K., J. B. Orlin, D. Sharma. 2000. Very large scale neighborhood search. Internat. Trans. Oper. Res. 7 301-317.
4. Ahuja, R. K., J. B. Orlin, D. Sharma. 2001b. New neighborhood search structures for the capacitated minimum spanning tree problem. Math. Programming 91 71-97.
5. Ahuja, R. K., J. B. Orlin, D. Sharma. 2003. A composite neighborhood search algorithm for the capacitated minimum spanning tree problem. Oper. Res. Lett. 31 185-194.
6. Ahuja, R. K., O. Ergun, J. B. Orlin, A. Punnen. 2002. A survey of very large scale neighborhood search techniques. Discrete Appl. Math. 123 75-102.
7. Benders, J. F., J. A. Keulemans, J. A. E. E. van Nunen, G. Stolk. 1986. A decision support program for planning locations and allocations with the aid of linear programming. C. B. Tilanus, O. B. de Gaus, J. K. Lenstra, eds. Quantitative Methods in Management: Case Studies of Failures and Successes, Chapter 4. Wiley, Chichester, UK, 29-34.
8. Duran, F. 1987. A large mixed integer production and distribution program. Eur. J. Oper. Res. 28 207-217.
9. Fahrion, R., M. Wrede. 1990. On a principle of chain exchange for vehicle routing problems (I-VRP). J. Oper. Res. Soc. 41 821-827.
10. Fleischmann, B. 1993. Designing distribution systems with transport economies of scale. Eur. J. Oper. Res. 70 31-42.
11. Frangioni, A., E. Necciari, M. G. Scutellá. 2000. A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems. J. Comhin. Optim. 8 195-220.
12. Gendreau, M., F. Guertin, J.-Y. Potvin, R. Séguin. 2006. Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Trans. Res. C. 14 157-174.
13. Geoffrion, A. M., G. W. Graves. 1974. Multicommodity distribution system design by Benders decomposition. Management Sci. 20 822-844.
14. ILOG. 2001. ILOG CPLEX 7.5 Reference Manual ILOG S. A., Gentilly France.
15. Martello, S., P. Toth. 1981. An algorithm for the generalized assignment problem. J. P. Brans, ed. Operational Research. North- Holland, Amsterdam, The Netherlands, 589-603.
16. Martello, S., P. Toth. 1990. Knapsack Problems, Algorithms and Computer Implementations. Wiley, New York.
17. Muriel, A. 1997. On the effectiveness of set-partitioning approaches for large-scale machine scheduling and supply-chain man agement problems. Ph.D. thesis, Northwestern University, Evanston, IL.
18. Muriel, A., D. Simchi-Levi. 2004. Supply chain design and planning- Applications of optimization techniques for strategic and tactical models. A. G. de Kok, S. C. Graves, eds. Handbooks in Operations Research and Management Science, Vol. 11. Supply Chain Management: Design, Coordination and Operation. Elsevier, Amsterdam, The Netherlands.
19. Myers, D. C. 1997. Meeting seasonal demand for products with limited shelf lives. Naval Res. Logist. 44 473-483.
20. Romeijn, H. E., D. Romero Morales. 2000. A class of greedy algorithms for the generalized assignment problem. Discrete Appl. Math. 103 209-235.
21. Romeijn, H. E., D. Romero Morales. 2001. A probabilistic analysis of the multi-period single-sourcing problem. Discrete Appl. Math. 112 301-328.
22. Romeijn, H. E., D. Romero Morales. 2002. A greedy heuristic for a three-level multi-period single-sourcing problem. A. Klose, M. G. Speranza, L. N. Van Wassenhove, eds. Quantitative Approaclies to Distribution Logistics and Supply Chun Management. Springer-Verlag, Berlin, Germany, 191-214.
23. Romeijn, H. E., D. Romero Morales. 2003. An asymptotically optimal greedy heuristic for the multi-period single-sourcing problem: The cyclic case. Naval Res. Logist. 50 412-437.
24. Romeijn, H. E., D. Romero Morales. 2004. Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case. J. Heuristics 10 5-35.
25. Romero Morales, D. 2000. Optimization problems in supply chain management. Ph.D. thesis, Rotterdam School of Management, Erasmus University Rotterdam, Rotterdam, The Netherlands.
26. Romero Morales, D., J. A. E. E. van Nunen, H. E. Romeijn. 1999. Logistics network design evaluation in a dynamic environment. M. G. Speranza, P. Stähly, eds. New Trends in Distribution Logistics. Springer-Verlag, Berlin, Germany, 113-135.
27. Thompson, P. M. 1988. Local search algorithms for vehicle routing and other combinatorial problems. Ph.D. thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
28. Thompson, P. M., J. B. Orlin. 1989. The theory of cyclic transfers. Working Paper OR 200-89, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
29. Thompson, P. M., H. N. Psaraftis. 1993. Cyclic transfer algorithms for multi-vehicle routing and scheduling problems. Oper. Res. 41 935-946.