A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints

References

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