Joint Inventory Replenishment and Component Allocation Optimization in an Assemble-to-Order System

References

• Agrawal N., Cohen M. A. Optimal material control in an assembly system with component commonality. Naval Res. Logist. (2001) 48:409–429Crossref, Google Scholar
• Akçay Y.Three essays on resource allocation problems (2002) . Ph.D. thesis, Penn State University, University Park, PAGoogle Scholar
• Axsäter S.Inventory Control (2000) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Baker K. R., Magazine M. J., Nuttle H. L. W. The effect of commonality on safety stock in a simple inventory model. Management Sci. (1986) 32(8):982–988Link, Google Scholar
• Chen F., Ettl M., Lin G., Yao D. D. Inventory-service optimization in configure-to-order systems: From machine-type models to building blocks. (2000) . Research report RC 21781 (98077), IBM Research Division, IBM T. J. Watson Research Center, York Heights, NYGoogle Scholar
• Gallien J., Wein L. M. A simple and effective procurement policy for stochastic assembly systems. . Working paper, Sloan School, MIT, Boston, MA.Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, San Francisco, CA) Google Scholar
• Gerchak Y., Henig M. Component commonality in assemble-to-order systems: Models and properties. Naval Res. Logist. (1989) 36:61–68Crossref, Google Scholar
• Gerchak Y., Magazine M. J., Gamble A. B. Component commonality with service level requirements. Management Sci. (1988) 34(6):753–760Link, Google Scholar
• Glasserman P., Wang Y. Leadtime inventory trade-offs in assemble-to-order systems. Oper. Res. (1998) 46:858–871Link, Google Scholar
• Hadley G., Whitin T. M.Analysis of Inventory Systems (1963) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Hausman W. H., Lee H. L., Zhang A. X. Joint demand fulfillment probability in a multi-item inventory system with independent order-up-to policies. Eur. J. Oper. Res. (1998) 109:646–659Crossref, Google Scholar
• Higle J. L., Sen S. Stochastic decomposition: An algorithm for two-stage linear programs with recourse. Math. Oper. Res. (1991) 16(3):650–669Link, Google Scholar
• Klee V., Minty G., Shisha O. How good is the simplex method. InequalitiesIII(Academic Press)159–175Google Scholar
• Kleywegt A. J., Shapiro A., de Mello T. H. The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. (2001) 12(2):479–502Crossref, Google Scholar
• Kochenberger G. A., McCarl B. A., Wyman F. P. A heuristic for general integer programming. Decision Sci. (1974) 5:36–44Crossref, Google Scholar
• Laporte G., Louveaux F. V. The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. (1993) 13:133–142Crossref, Google Scholar
• Lee H. L., Tang C. S. Modelling the costs and benefits of delayed product differentiation. Management Sci. (1997) 43:40–53Link, Google Scholar
• Lin E. Y.-H. A bibliographical survey on some well-known non-standard knapsack problems. INFOR (1998) 36(4):274–317Google Scholar
• Loulou R., Michaelides E. New greedy-like heuristics for the multidimensional 0-1 knapsack problem. Oper. Res. (1979) 27:1101–1114Link, Google Scholar
• Magazine M. J., Oguz O. A heuristic algorithm for the multidimensional zero-one knapsack problem. Eur. J. Oper. Res. (1984) 16:319–326Crossref, Google Scholar
• Pirkul H., Narasimhan S. Efficient algorithms for the multiconstraint general knapsack problem. IIE Trans. (1986) 195–203Crossref, Google Scholar
• Schraner E. Capacity/inventory trade-offs in assemble-to-order systems. (1995) . Working paper, Department of Operations Research, Stanford University, Stanford, CA.Google Scholar
• Senju S., Toyoda Y. An approach to linear programming with 0-1 variables. Management Sci. (1968) 15(4):B196–B207Link, Google Scholar
• Shapiro A. Stochastic optimization by Monte Carlo simulation methods. (2000) . Preprint, Georgia Institute of Technology, Atlanta, GA.Google Scholar
• Song J.-S. On the order fill rate in a multi-item, base-stock inventory system. Oper. Res. (1998) 46(6):831–845Link, Google Scholar
• Song J.-S., Yao D. D. Performance analysis and optimization of assemble-to-order systems with random leadtimes. (2000) . Preprint.Google Scholar
• Song J.-S., Zipkin P., De Kok T., Graves S. Supply chain operations: Assemble-to-order systems. Handbooks in Operations Research and Management Science, Vol. 30: Supply Chain Management (2004) (North-Holland)Google Scholar
• Song J.-S., Xu S. H., Bin L. Order fulfillment performance measures in an assemble-to-order system with stochastic leadtimes. Oper. Res. (1999) 47:131–149Link, Google Scholar
• Swaminathan J. M., Tayur S. R. Stochastic programming models for managing product variety. Quantitative Models for Supply Chain Management (1999) (Kluwer Academic Publishing, Boston, MA) 585–624Crossref, Google Scholar
• Toyoda Y. A simplified algorithm for obtaining approximate solutions to zero-one programming problems. Management Sci. (1975) 21(12):1417–1427Link, Google Scholar
• Verweij B., Ahmed S., Kleywegt A., Nemhauser G., Shapiro A. The sample average approximation method applied to stochastic routing problems: A computational study. Comput. Appl. Optim. (2003) 24:289–333Crossref, Google Scholar
• Wang Y. Near-optimal base-stock policies in assemble-to-order systems under service level requirements. (1999) . Working paper, Sloan School, MIT, Boston, MA.Google Scholar
• Xu S. H. Structural analysis of a queueing system with multi-classes of correlated arrivals and blocking. Oper. Res. (1999) 47:264–276Link, Google Scholar
• Zhang A. X. Demand fulfillment rates in an assemble-to-order system with multiple products and dependent demands. Production Oper. Management (1997) 6(3):309–323Crossref, Google Scholar