IBM®
Skip to main content
    Country/region [change]    Terms of use
 
 
 
    Home    Products    Services & solutions    Support & downloads    My account    

IBM Journal of Research and Development
Business Optimization   Volume 51, Number 3/4, 2007
Table of contents: HTMLPDF This article: HTMLPDF   Copyright info

Inventory allocation and transportation scheduling for logistics of network-centric military operations - References

 by F. Barahona,
P. Chowdhary,
M. Ettl,
P. Huang,
T. Kimbrel,
L. Ladanyi,
Y. M. Lee,
B. Schieber,
K. Sourirajan,
M. I. Sviridenko,
and G. M. Swirszcz
References

  1. M. Ettl, G. Feigin, G. Lin, and D. Yao, “A Supply Network Model with Base-Stock Control and Service Requirements,” Oper. Res. 48, No. 3, 216–232 (2000).
  2. V. Deshpande, M. Cohen, and K. Donohue, “An Empirical Study of Service Differentiation for Weapon System Service Parts,” Oper. Res. 51, No. 4, 518–530 (2003).
  3. S. Graves and S. Willems, “Supply Chain Design: Safety Stock Placement and Supply Chain Configuration,” Supply Chain Management: Design, Coordination and Operation, A. De Kok and S. Graves, Editors, Handbooks in Operations Research and Management Science 11, Elsevier, 2003, pp. 95–132.
  4. J. Muckstadt, Analysis and Algorithms for Service Parts Supply Chains, Springer Series in Operations Research and Financial Engineering, Springer, New York, 2004.
  5. F. Cheng, M. Ettl, G. Lin, and D. Yao, “Inventory-Service Optimization in Configure-to-Order Systems,” Manuf. Services & Oper. Manage. 4, No. 2, 114–132 (2002).
  6. B. Dietrich, D. Connors, T. Ervolina, J. Fasano, R. Lougee-Heimer, and R. Wittrock, “Applications of Implosion in Manufacturing,” Supply Chain Management On Demand, C. An and H. Fromm, Editors, Springer, New York, 2005, pp. 97–115.
  7. K. Caggiano, J. Muckstadt, and J. Rappold, “Integrated Real-Time Capacity and Inventory Allocation for Repairable Service Parts in a Two-Echelon Supply System,” Manuf. Services & Oper. Manage. 8, No. 3, 292–319 (2006).
  8. C. Barnhart, E. Johnson, G. Nemhauser, M. Savelsbergh, and P. Vance, “Branch-and-Price: Column Generation for Solving Huge Integer Programs,” Oper. Res. 46, No. 3, 316–329 (1998).
  9. J. Desrosiers, F. Soumis, and M. Desrochers, “Routing with Time Windows by Column Generation,” Networks 14, No. 4, 545–565 (1984).
  10. J. Bramel and D. Simchi-Levi, “On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows,” Oper. Res. 45, No. 2, 295–301 (1997).
  11. J. Desrosiers, Y. Dumas, M. Solomon, and F. Soumis, “Time Constrained Routing and Scheduling,” Network Routing, M. Ball, T. Magnanti, C. Monma, and G. Nemhauser, Editors, Handbooks in Operations Research and Management Science 8, North-Holland, Amsterdam, 1995, pp. 35–139.
  12. M. Solomon and J. Desrosiers, “Time Window Constrained Routing and Scheduling Problems,” Transport. Sci. 22, No. 11, 1–13 (1988).
  13. H. Psaraftis, “Dynamic Vehicle Routing: Status and Prospects,” Ann. Oper. Res. 61, 143–164 (1995).
  14. M. Gendreau and J. Potvin, “Dynamic Vehicle Routing and Dispatching,” Fleet Management Logistics, T. Crainic and G. Laporte, Editors, Kluwer, Boston, 1998, pp. 115–226.
  15. M. Gendreau, F. Guertin, J. Y. Potvin, and R. Séguin, “Neighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-Ups and Deliveries,” Transport. Res. Part C 14, 157–174 (2006).
  16. G. Clarke and J. V. Wright, “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points,” Oper. Res. 12, No. 4, 568–581 (1964).
  17. G. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1998.
  18. COIN-OR, Computational Infrastructure for Operations Research; see http://www.coin-or.org/Clp.
  19. E. Aarts and J. Lenstra, Local Search in Combinatorial Optimization, Princeton University Press, Princeton, NJ, 2003.
  20. T. Ibaraki, K. Nonobe, and M. Yagiura, Editors, “Metaheuristics: Progress as Real Problem Solvers,” Operations Research/Computer Science Interfaces Series, Vol. 32, Springer, New York, 2005.
  21. R. Ahuja, O. Ergun, J. Orlin, and A. Punnen, “A Survey of Very Large-Scale Neighborhood Search Techniques,” Discrete Appl. Math. 123, Nos. 1–3, 75–102 (2002).
  22. M. Dror and L. Levy, “A Vehicle Routing Improvement Algorithm Comparison of ‘Greedy’ and a Matching Implementation for Inventory Routing,” Computers & Oper. Res. 13, No. 1, 33–45 (1986).


    About IBM    Privacy    Contact