Improving Operations and Quoting Accurate Lead Times in a Laminate Plant

References

  • Anupindi R., Tayur S. Managing stochastic multi-product systems: Model, measures, and analysis. Operations Research (1998) May–June46(3):98–111LinkGoogle Scholar
  • Bashyam S., Fu M. C. Application of perturbation analysis to a class of (s,S) inventory systems. Naval Research Logistics (1994) January–February41(1):47–80CrossrefGoogle Scholar
  • Bowman R. A., Muckstadt J. A. Stochastic analysis of cyclic schedules. Operations Research (1993) September–October41(5):947–958LinkGoogle Scholar
  • Bratley P., Fox B. L., Schrage L. E.A Guide to Simulation (1987) (Springer Verlag, New York) CrossrefGoogle Scholar
  • Caramanis M., Liberopolous G. Perturbation analysis for the design of flexible manufacturing system flow controllers. Operations Research (1992) November–December40(6):1107–1125LinkGoogle Scholar
  • Dobson G. The economic lot scheduling problem: Achieving feasibility using time-varying lot sizes. Operations Research (1987) September–October35(5):764–771LinkGoogle Scholar
  • Elmagrabhy S. E. The economic lot scheduling problem (ELSP): Review and extensions. Management Science (1978) 24(5):587–598LinkGoogle Scholar
  • Fu M., Hu J. Q. (s,S) inventory systems with random lead times: Harris Recurrence and its implications in sensitivity analysis. Probability in the Engineering and Informational Sciences (1994) 8(3):355–376CrossrefGoogle Scholar
  • Gallego G. Scheduling the production of several items with random demands in a single facility. Management Science (1990) 36(12):1579–1592LinkGoogle Scholar
  • Glasserman P.Bounds and asymptotics for planning critical safety stocks (1993) (Graduate School of Business, Columbia University, New York) . working paperGoogle Scholar
  • Glasserman P., Tayur S. The stability of a capacitated, multi-echelon production-inventory system under a base-stock policy. Operations Research (1994) 42(5):913–925LinkGoogle Scholar
  • Glasserman P., Tayur S. Sensitivity analysis for base-stock levels in multi-echelon production-inventory systems. Management Science (1995) 41(2):263–281LinkGoogle Scholar
  • Graves S. C. The multi-product production cycling problem. AIIE Transactions (1980) 12:233–240CrossrefGoogle Scholar
  • Leachman R. C., Gascon André. A heuristic scheduling policy for multi-item single-machine production systems with time-varying stochastic demands. Management Science (1988) 34(3):377–390LinkGoogle Scholar
  • Leachman R. C., Xiong Zhong K., Gascon André, Kwangtae Park. Note: An improvement to the dynamic cycle lengths heuristic for scheduling the multi-item, single-machine. Management Science (1991) 37(9):1201–1205LinkGoogle Scholar
  • Markowitz D., Reiman I., Wein L.The stochastic economic lot scheduling problem: Heavy traffic analysis of dynamic cyclic policies (1995) (Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts) . working paperGoogle Scholar
  • Nahmias S.Production and Operations Analysis (1993) (Richard D. Irwin, New York) Google Scholar
  • Takagi H.Analysis of Polling Systems (1986) (MIT Press, Cambridge, Massachusetts) Google Scholar
  • Tayur S. Structural properties and a heuristic for kanban controlled serial lines. Management Science (1993) 39(11):1347–1368LinkGoogle Scholar
  • Tayur S., Thomas R., Natraj N. R. An algebraic geometry algorithm for scheduling in presence of setups and correlated demands. Mathematical Programming (1995) 69(3):369–402CrossrefGoogle Scholar
  • Umble M., Srikanth M. L.Synchronous Manufacturing (1990) (Southwestern Publishing, Cincinnati, Ohio) Google Scholar
  • Yan H., Yin G., Lou S. X. C.Approximating optimal threshold values for unreliable manufacturing systems via stochastic optimization (1992) 31st Conference on Decision and Control(New Orleans, Louisiana)CrossrefGoogle Scholar
  • Zipkin P. Computing optimal lot sizes in the economic lot scheduling problem. Operations Research (1991) 39(1):56–63LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.