Research

Theory

  1. Iravani, S., T. Liu, K. L. Luangkesorn and D. Simchi-Levi (2006), A Produce-to-Stock System with Advance Demand Information and Secondary Customers. To appear in Naval Research Logistics.

  2. Duranx, S., T. Liu, D. Simchi-Levi, and J. Swann, (2006), Optimal Production and Inventory Policies of Priority, Time and Price Differentiated Customers. To appear in IIE Transactions.

  3. Chen, X., M. Sim, D. Simchi-Levi, and P. Sun (2006), Risk Aversion in Inventory Management. To appear in Operations Research.


  4. Martinez de Albeniz, V. and D. Simchi-Levi (2006), Mean-Variance Trade-offs in Supply Contracts. Naval Research Logistics, 53 pp. 603-616.


  5. Chan, L. M. A., D. Simchi-Levi and J. Swann, (2005), Dynamic Pricing Strategies for Manufacturing with Stochastic Demand and Discretionary Sales. Manufacturing & Service Operations Management, 8 pp. 149-168.


  6. Zhao, Y. and D. Simchi-Levi, (2005), Performance Analysis and Evaluation of Assemble-to-Order Systems With Stochastic Sequential Lead Times. Operations Research, 54 pp. 706-724.


  7. Chou, C. F., H. Liu, M. Queyranne and D. Simchi-Levi (2005), On the Asymptotic Optimality of a Simple On-line Algorithm for the Stochastic Single Machine Weighted Completion Time Problem and its Extensions. Operations Research, 54 pp. 464-474.


  8. Chen, X. and D. Simchi-Levi, (2006), Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Continuous Review Model. Operations Research Letters, 36 pp. 323-332.


  9. Magnanti, T. L., Z.-J. M. Shen, J. Shu, D. Simchi-Levi and C. P. Teo (2006), Inventory Placement in Acyclic Supply Chain Networks. Operations Research Letters, 36 pp. 228-238.


  10. Chou, C. F., M. Queyranne and D. Simchi-Lev (2006), The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates. Mathematical Programming, 106 pp. 137-157.


  11. Martinez de Albeniz, V. and D. Simchi-Levi (2005), A Portfolio Approach for Procurement Contracts. Production and Operations Management, 14 pp. 90-114.


  12. Simchi-Levi, D. and Y. Zhao, (2005), Safety Stock Positioning in Supply Chains with Stochastic Lead Times. Manufacturing & Service Operations Management, 7 pp. 295-318.


  13. Hui, L., M. Queyranne and D. Simchi-Levi, (2005), On the Asymptotic Optimality of Algorithms for the Flow Shop Problem with Release Dates. Naval Research Logistics, 52 pp. 232–242.


  14. Biller, S., L. M. A. Chan, D. Simchi-Levi and J. Swann, (2005), Dynamic Pricing and the Direct-to-Consumer Model in the Automotive Industry. Electronic Commerce Journal, 5 pp. 309-334.


  15. Chen, X. and D. Simchi-Levi, (2004), Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Finite Horizon Case. Operations Research, 52 pp. 887-896.

  16. Chen, X. and D. Simchi-Levi, (2004), Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Infinite Horizon Case. Mathematics of Operations Research, 29 pp. 698-723.


  17. Chan, L. M. A., Z. J. Shen, D. Simchi-Levi, J. L. Swann (2004),Coordination of Pricing and Inventory Decisions: A Survey and Classification.Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era, D. Simchi-Levi, S. D. Wu and Z. J. Shen, eds. Kluwers, pp. 335-392.


  18. Iravani, S. M. R., K. L. Luangkesorn and D. Simchi-Levi, (2004), A General Decomposition Algorithm for Parallel Queues with Correlated Arrivals.Queueing Systems, 47, pp. 313-344.


  19. Simchi-Levi, D. and Y. Zhao, (2004) The Value of Information Sharing in a Two-stage Supply Chain with Production Capacity Constraints: The Infinite Horizon Case.  Probability in the Engineering and Informational Science, 18, pp.247-274.


  20. Caglar, D., C. L. Li and D. Simchi-Levi, (2004), Two-Echelon Spare Parts Inventory System Subject to a Service Constraint. IIE Transactions, 36, pp. 655-666.


  21. Muriel, A. and D. Simchi-Levi, (2003), Supply Chain Design and Planning - Applications of Optimization Techniques for Strategic and Tactical Models. Handbooks in Operations Research and Management Science, the volume on Supply Chain Management. S. Graves and A. G. Kok, eds., North-Holland, Amsterdam, pp. 17-89.


  22. Mirchandani, P. and D. Simchi-Levi, (2003), Communications Network Design Models. Handbook of Graph Theory. J. L. Gross and J. Yellen eds., CRC Press, pp. 1117-1138.


  23. Simchi-Levi, D. and Y. Zhao, (2003), The Value of Information Sharing in a Two-stage Supply Chain with Production Capacity Constraints. Naval Research Logistics, 50, pp. 888-916.


  24. Iravani, S. M. R., K. L. Luangkesorn and D. Simchi-Levi, (2003) On Assemble-To-Order Systems with Flexible Customers. IIE Transactions, 35, pp. 389-403.


  25. Kaminsky, P. and D. Simchi-Levi, (2003) Production and Distribution Lot Sizing in a Two Stage Supply Chain. IIE Transactions, 35, pp. 1065-1075.


  26. Chan, L. M. A., A. Muriel, Z. J. Shen, D. Simchi-Levi, and C. P. Tew, (2002) Effective Zero Inventory Ordering Policies for the Single-Warehouse Multi-Retailer Problem with Piecewise Linear Cost Structures. Management Science, 48, pp. 1446-1460.


  27. Chan, L. M. A., A. Muriel, Z. J. Shen and D. Simchi-Levi, (2002) On the Effectiveness of the Zero-Inventory-Ordering Policy for the Economic Lot Sizing Model with Piecewise Linear Cost Structures. Operations Research, 50, pp. 1058-1067.


  28. Kaminsky, P. and D. Simchi-Levi, (2001) Asymptotic Analysis of an On-Line Algorithm for the Single Machine Completion Time Problem With Release Dates. Operations Research Letters, 29, pp. 141-148.


  29. Bramel, J. and D. Simchi-Levi (2002), Set-Covering Based Algorithms for the Capacitated VRP. The Vehicle Routing Problem, P. Toth and D. Vigo, eds., SIAM Monographs on Discrete Mathematics and Applications, pp. 85—106.


  30. Chen Y. F., Y. Feng and D. Simchi-Levi,Uniform distribution of inventory positions in two-echelon periodic review systems with batch-ordering policies and interdependent demands. European Journal of Operations Research, 140, pp. 648-654.


  31. E. K. Demir, T. Leong, C. L. Li, J. Ng, and D. Simchi-Levi (2001), Locating Containers in a Mega Terminal. Naval Research Logistics, 48, pp. 363—385.


  32. Simchi-Levi, D. and E. Simchi-Levi (2001), Logistics Systems Modeling. Handbook of Industrial Engineering, 3rd edition, edited by G. Salvendy and published by John Wiley & Sons, pp. 2007—2019.


  33. Chou, C. F., M. Queyranne and D. Simchi-Levi (2001), The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates. Proceeding of the 8th International IPCO Conference, Utrecht, The Netherlands, June 2001, pp. 45—59.


  34. Gallego, G., J. K. Ryan and D. Simchi-Levi (2000), Minimax Analysis for the Discrete Finite Horizon Inventory Model. IIE Transactions, October 2000, pp. 861-874.


  35. Kaminsky, P. and D. Simchi-Levi (2001), The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem. Operations Research, 49, pp. 293—304.


  36. Chen, Y. F., J. K. Ryan and D. Simchi-Levi (2000), The Impact of Exponential Smoothing Forecasts on the Bullwhip Effect. Naval Research Logistics, 47, pp. 269—286.


  37. Chen, Y. F., Z. Drezner, J. K. Ryan and D. Simchi-Levi (2000), Quantifying the Bullwhip Effect in a Simple Supply Chain: The Impact of Forecasting, Lead Times and Information. Management Science, 46, pp. 436—443.


  38. Chopra, S. and D. Simchi-Levi (1999), Communication Networks. CRC Handbook of Discrete and Combinatorial Mathematics, K. H. Rosen et al. (eds.), CRC Press, Boca Raton, FL, pp. 683—692.


  39. Chopra, S. and D. Simchi-Levi (1999), Packing and Covering. CRC Handbook of Discrete and Combinatorial Mathematics, K. H. Rosen et al. (eds.), CRC Press, Boca Raton, FL, pp. 996—1006.


  40. Kaminsky, P. and D. Simchi-Levi (1998), A New Computerized Beer Game: Teaching the Value of Integrated Supply Chain Management. Supply Chain and Technology Management. Hau Lee and Shu Ming Ng, eds., POMS Series in Technology and Operations Management, Volume 1, pp. 216—225.


  41. Chan, L. M. A. and D. Simchi-Levi (1998), Probabilistic Analysis and Practical Algorithms for Three-Level Distribution Systems. Management Science, 44, pp. 1562— 1576.


  42. Kaminsky, P. and D. Simchi-Levi (1998), Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem. Operations Research, 46, pp. 872—882.


  43. Chen, Y. F., Z. Drezner, J. K. Ryan and D. Simchi-Levi (1998), The Bullwhip Effect: Managerial Insights on the Impact of Forecasting and Information on Variability in a Supply Chain. Quantitative Models for Supply Chain Management, S. Tayur, R. Ganeshan and M. Magazine, eds., Kluwer, pp. 417—439.


  44. Chan, L. M. A., A. Muriel and D. Simchi-Levi (1998), Parallel Machine Scheduling, Linear Programming and List Scheduling Heuristics. Operations Research, 46, pp. 729—741.


  45. Chan, L. M. A., D. Simchi-Levi and J. Bramel (1998), Worst-case Analyses, Linear Programming and the Bin-packing Problem. Mathematical Programming, 83, pp. 213—227.


  46. Chan, L. M. A., A. Federgruen and D. Simchi-Levi (1998), Probabilistic Analysis and Practical Algorithms for Inventory Routing Models. Operations Research, 46, pp. 96—106.


  47. Braca, J., J. Bramel, B. Posner and D, Simchi-Levi (1997), A Computerized Approach to the New York City School Bus Routing Problem. IIE Transactions, 29, pp. 693—702.


  48. Bramel, J., W. T. Rhee and D. Simchi-Levi (1997), Average Case Analysis of the Bin¬Packing Problem with General Cost Structure. Naval Research Logistics, 44, pp. 673—686.


  49. Bramel, J. and D, Simchi-Levi (1997), On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem. Operations Research, 45, pp. 295—301.


  50. Gallego, G., M. Queyranne and D. Simchi-Levi (1996), Single Resource Multi-Item Inventory Systems. Operations Research, 44, pp. 580—595.


  51. Bramel, J. and D. Simchi-Levi (1996), Probabilistic Analysis and Practical Algorithms for the Vehicle Routing Problem with Time Windows. Operations Research, 44, pp. 501-509.


  52. Pinedo, M. and D. Simchi-Levi (1996), Heuristics Methods. Mathematical Programming for Industrial Engineers, pp. 575—617, M. Avreil and B. Golany (eds.) Marcel Dekker, Inc., NY.


  53. Bertsimas, D. and D. Simchi-Levi (1996), The New Generation of Vehicle Routing Research: Robust Algorithms Addressing Uncertainty. Operations Research, 44, pp. 286-304.


  54. Bala, K., T. E. Stern, D. Simchi-Levi and K. Bala (1994), Routing in Linear Lightwave Networks. IEEE/ACM Transactions on Networking, 3 pp. 459-469.


  55. Bramel, J. and D. Simchi-Levi (1995), A LocationBased Heuristic for General Routing Problems. Operations Research, 43, pp. 649-660.


  56. Berman, O., P. Jaillet and D. Simchi-Levi (1995). Location-Routing Problems with Uncertainty.Facilities Location, Z. Drezner edt., Springer Verlag, pp. 427-452.


  57. Federgruen, A. and D. Simchi-Levi (1995), Analytical Analysis of Vehicle Routing and Inventory Routing problems.Handbooks in Operations Research and Management Science, the volume on NetworkRouting. M. Ball, T. Magnanti, C. Monma and G. Nemhauser, eds., North-Holland, Amsterdam, pp. 297-373.


  58. Averbakh, I., O. Berman and D. Simchi-Levi (1994), Probabilistic a Priori Routing Location Problems. Naval Research Logistics, 41, pp. 973-989.


  59. Gallego, G. and D. Simchi-Levi (1994), Rejoinder to "A Note on Bounds for Direct Shipping." Management Science, 40, pp. 1393.


  60. Simchi-Levi, D. (1994), New Worst Case Results for the Bin-Packing Problem. Naval Research Logistics, 41, pp. 579-585.


  61. Anily, S., J. Bramel and D. Simchi-Levi (1994), Worst-Case Analysis of Heuristics for the Bin-Packing Problem with General Cost Structure. Operations Research, 42, pp. 287-298.


  62. Bramel, J., C. L. Li and D. Simchi-Levi (1993), Probabilistic Analysis of Heuristics for the Vehicle Routing with Time Windows. American Journal of Mathematical and Management Sciences,13, pp. 267-322.


  63. Bienstock, D., J. Bramel and D. Simchi-Levi (1993), A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands. Mathematics of Operations Research, 18, pp. 786-802.


  64. Bienstock, D., M. Goemans, D. Simchi-Levi and D. Williamson (1993), A Note on the Prize Collecting Traveling Salesman Problem. Mathematical Programming, 59, pp. 413-420.


  65. Drezner, Z. and D. Simchi-Levi (1992), Asymptotic Behavior of the Weber Location Problem on the Plane. Annals of Operations Research, 40, pp. 163-172.


  66. Sigman, K. and D. Simchi-Levi (1992), Light Traffic Heuristic for an M/G/1 Queue with Limited Inventory. Annals of Operations Research, 40, pp. 371-380.


  67. Li, C. L.,S. T. McCormick and D. Simchi-Levi (1992), Finding Disjoint Paths with Different Paths - Costs: Complexity and Algorithms. Networks, 22, pp. 653-667.


  68. Bramel, J., E. G. Coffman, Jr., P. W. Shor and D. Simchi-Levi (1992), Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands. Operations Research, 40, pp. 1095-1106.


  69. Gallego, G., D. Simchi-Levi and D. Xiao (1992), The Complexity of the Staggering Problem and Other Classical Inventory Problems. Operations Research Letters, 12, pp. 47-52.


  70. Li, C. L.,S. T. McCormick and D. Simchi-Levi (1992), On the Minimum-Cost-Bounded Diameter and the Fixed-Budget-Minimum-Diameter Edge Addition Problems. Operations Research Letters, 11, pp. 303-308.


  71. Li, C. L., D. Simchi-Levi and M. Desrochers (1992), On the Distance Constrained Vehicle Routing Problem. Operations Research, 40, pp. 790-800.


  72. Gavish, B., C. L. Li and D. Simchi-Levi (1992), Analysis of Heuristics for the Design of Tree Networks. Annals of Operations Research, 36, pp. 77-86.


  73. Li, C. L., S. T. McCormick and D. Simchi-Levi (1992), The Point-to-Point Delivery and Connection Problems: Complexity and Algorithms. Discrete Applied Mathematics, 36, pp. 267 -292.


  74. Simchi-Levi, D. (1992), Hierarchical Design for Probabilistic Distribution Systems in Euclidean Spaces. Management Science, 38, pp. 198-211.


  75. Gallego, G., I. Moon and D. Simchi-Levi (1991), Controllable Production Rates in a Family Production Context. International J. of Production Research, 29, pp. 2459-2470.


  76. Simchi-Levi, D. and O. Berman (1991), Minimizing the Total Flow Time of $n$ Jobs on a Network. IIE Transactions, 23, pp. 236 -244.


  77. Simchi-Levi, D. (1991), The Capacitated Traveling Salesman Location Problem. Transportation Science, 25, pp. 9-18.


  78. Drezner, Z., S. Schaible and D. Simchi-Levi (1990), A Queueing-Location Problem on the Plane. Naval Research Logistics, 37, pp. 929-935.


  79. Simchi-Levi, D. and O. Berman (1990), Optimal Locations and Districts of Two Traveling Salesman in a Tree. Networks,20, pp. 803 -815.


  80. Li, C. L. and D. Simchi-Levi (1990), Worst-Case Analysis of Heuristics for the Multi-Depot Capacitated Vehicle Routing Problems. ORSA J. on Computing, 2, pp. 64-73.


  81. Berman, O. and D. Simchi-Levi (1990), Conditional Location Problems on Networks. Transportation Science, 24, pp. 77-78.


  82. Gallego, G. and D. Simchi-Levi (1990), On the Effectiveness of Direct Shipping Strategy for the One Warehouse Multi-Retailer R-Systems. Management Science, 36, pp. 240-243.


  83. Henig, M. I. and D. Simchi-Levi (1990), Scheduling Tasks with Failure Probabilities to Minimize Expected Cost. Naval Research Logistics, 37 pp. 99 -109.


  84. Li, C. L.,S. T. McCormick and D. Simchi-Levi (1990), The Complexity of Finding Two Disjoint Paths with Min Max Objective Function. Discrete Applied Mathematics, 26, pp. 105-115.


  85. Berman, O. and D. Simchi-Levi (1989), The Traveling Salesman Location Problem on Stochastic Networks. Transportation Science, 23, pp. 54-57.


  86. Berman, O. and D. Simchi-Levi (1988), Minisum Location of a Traveling Salesman on Simple Networks. European Journal of Operations Research, 36, pp. 241 -250.


  87. Berman, O., D. Simchi-Levi and A. Tamir (1988), The Minimax Multistop Location Problem on a Tree. Networks, 18, pp. 39-49.


  88. Berman, O. and D. Simchi-Levi (1988), Finding the Optimal A Priori Tour and Location ofa Traveling salesman with Non Homogeneous Customers. Transportation Science, 22, pp. 148 -154.


  89. Simchi-Levi, D. and O. Berman (1988), A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks. Operations Research, 36, pp. 478 -474.


  90. Simchi-Levi, D. and O. Berman (1987), Heuristics and Bounds for the Traveling Salesman Location Problem on the Plane. Operations Research Letters, 6, pp. 243 -248.


  91. Berman O. and D. Simchi-Levi (1986), Minsum Location of a Traveling Salesman. Networks, 16, pp. 239-254.

News   »

dot Simchi-Levi elected INFORMS Fellow (more)

dot Simchi-Levi's paper "Supply Chain Coordination and Influenza Vaccination" won Pierskella Award Best Paper (more)

Events    »

dot Executive Programs Supply Chain Strategy and Management
April 12-13, 2007
July 12-13, 2007
December 5-6, 2007 (more)

dot  Upcoming Board Meeting
Managing Risk in the Global Supply Chain
May 10, 2007 ( more)

Research Highlight

NASA Project

NASA Sponsored Research: Interplanetary Supply Chain Management

» link