Demand Allocation in Multiple-Product, Multiple-Facility, Make-to-Stock Systems

References

• Albin S. L. Approximating a point process by a renewal process, II: Superposition arrival processes to queues. Oper. Res. (1984) 32:1133–1162Link, Google Scholar
• Bazaraa M. S., Shetty C. M.Nonlinear Programming (1979) (John Wiley & Sons Inc., New York) Google Scholar
• Benjaafar S., Gupta D. Workload allocation in multi-product, multi-facility production systems with setup times. IIE Trans. (1999) 31:339–352Crossref, Google Scholar
• Benjaafar S., Cooper W. L., Kim J. S. On the benefit of pooling in production-inventory systems. (2004a) . Working paper, University of Minnesota, Minneapolis, MNGoogle Scholar
• Benjaafar S., Elhafsi M., de Véricourt F. Supplement to demand allocation in multi-product, multi-facility make-to-stock systems. (2003) . Working paper, University of Minnesota, Minneapolis, MNGoogle Scholar
• Benjaafar S., Kim J. S., Vishwanadham N. On the effect of product variety in a production-inventory system. Ann. Oper. Res. (2004b) 126:71–101Crossref, Google Scholar
• Buzacott J. A., Shanthikumar J. G.Stochastic Models of Manufacturing Systems (1993) (Prentice Hall, Engelwood Cliffs, NJ) Google Scholar
• Cattrysse D., Van Wassenhove L. N. A survey of algorithms for the generalized assignment problem. Eur. J. Oper. Res. (1992) 60:260–272Crossref, Google Scholar
• Fisher M. L. The Lagrangian relaxation method for solving integer programming problems. Management Sci. (1981) 14:1–18Link, Google Scholar
• Green L. V., Guha D. On the efficiency of imbalance in multi-facility multi-server service systems. Management Sci. (1995) 41:179–187Link, Google Scholar
• Gupta D., Benjaafar S. Make-to-order, make-to-stock, or delay product differentiation? A common framework for modeling and analysis. IIE Trans. (2004) 36:529–546Crossref, Google Scholar
• Ha A. Optimal dynamic scheduling policy for a make-to-stock production system. Oper. Res. (1997) 45:42–53Link, Google Scholar
• Liu Z., Righter R. Optimal load balancing on distributed homogenous unreliable processors. Oper. Res. (1998) 46(4):563–573Link, Google Scholar
• Martello S., Toth P.Knapsack Problems: Algorithms and Computer Implementation (1990) (Wiley, New York) Google Scholar
• Ni L. M., Hwang K. Optimal load balancing in multiple processor systems with many job classes. IEEE Trans. Software Engrg. (1985) SE-11:491–496Crossref, Google Scholar
• Osman J. H. Heuristics for the generalized assignment problem: Simulated annealing and tabu search approaches. OR Spektrum (1995) 17:211–225Crossref, Google Scholar
• Peterson W. P. A heavy traffic limit theorem for networks of queues with multiple customer types. Math. Oper. Res. (1991) 16:90–118Link, Google Scholar
• Ross G. T., Soland R. M. A branch and bound algorithm for the generalized assignment problem. Math. Programming (1975) 8:91–103Crossref, Google Scholar
• Tang C. S., Van Vliet. Traffic allocation for manufacturing systems. Eur. J. Oper. Res. (1994) 75:171–185Crossref, Google Scholar
• Van Houtum G. J., Adan I., Van Der Wal J. The symmetric longest queue system. Stochastic Models (1997) 13:105–120Crossref, Google Scholar
• de Véricourt F., Dallery Y. Non-optimality of static-priority policies in unreliable two part type production system. IEEE Trans. Automatic Control (2000) 45:309–311Crossref, Google Scholar
• de Véricourt F., Veatch M. Zero-inventory conditions for a two-part type make-to-stock production system. Queuing System Theory Appl. (2003) 43:251–266Crossref, Google Scholar
• de Véricourt F., Karaesmen F., Dallery Y. Dynamic scheduling in a make-to-stock system: A partial characterization of optimal policies. Oper. Res. (2000) 48:811–819Link, Google Scholar
• de Véricourt F., Karaesmen F., Dallery Y. Assessing the benefits of rationing and scheduling policies for a make-to-stock production system. Manufacturing Service Oper. Management (2001) 3:105–121Link, Google Scholar
• de Véricourt F., Karaesmen F., Dallery Y. Stock allocation for a capacitated supply system. Management Sci. (2002) 48:1486–1501Link, Google Scholar
• Wang Y., Morris R. J. T. Load sharing in distributed systems. IEEE Trans. Comput. (1985) 34:204–317Crossref, Google Scholar
• Wein L. M. Dynamic scheduling of a multiclass make-to-stock queue. Oper. Res. (1992) 40:724–735Link, Google Scholar
• Whitt W. Approximating a point process by a renewal process, I: Two basic approaches. Oper. Res. (1982) 30:125–147Link, Google Scholar
• Wolff R. W.Stochastic Modelling and the Theory of Queues (1989) (Prentice-Hall, Engelwood Cliffs, NJ) Google Scholar
• Tijms H. C.Stochastic Models: An Algorithmic Approach (1995) (John Wiley and Sons, New York) Google Scholar
• Zheng Y. S., Zipkin P. A queueing model to analyze the value of centralized inventory information. Oper. Res. (1990) 38:296–307Link, Google Scholar
• Zipkin P. H. Performance analysis of a multi-item production-inventory system under alternative policies. Management Sci. (1995) 41:690–703Link, Google Scholar
• Zipkin P. H.Foundations of Inventory Management (2000) (McGraw-Hill, New York) Google Scholar