Finding Optimal Material Release Times Using Simulation-Based Optimization

Published Online:https://doi.org/10.1287/mnsc.45.1.86

References

  • Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows (1993) (Prentice-Hall, New York) Google Scholar
  • Bazaraa M. S., Sherali H. D., Shetty C. M.Nonlinear Programming: Theory and Algorithms (1993) (John Wiley & Sons, New York) Google Scholar
  • Danskin J. M.The Theory of Max-Min and Its Applications to Weapons Allocation Problems (1967) (Springer, New York) CrossrefGoogle Scholar
  • Fiacco A. V.Introduction to Sensitivity and Stability Analysis in Nonlinear Programming (1983) (Academic Press, New York) Google Scholar
  • Graves S. C. A tactical planning model for a job shop. Oper. Res. (1986) 34(4):522–533LinkGoogle Scholar
  • Graves S. C., Rinnooy Kan A. H. G., Zipkin P. H.Logistics of Production and Inventory, Vol. 4 of Handbooks in Operations Research and Management Science (1993) (North-Holland, Amsterdam, The Netherlands) Google Scholar
  • Gumaer R. Beyond ERP and MRP II: Optimized planning and synchronized manufacturing. IIE Solutions (1996) 32–35Google Scholar
  • Hasan C. N., Spearman M. L. Determining optimal material release times in stochastic production environments using infinitesimal perturbation analysis. (1996) . PreprintGoogle Scholar
  • Hopp W. J., Spearman M. L.Factory Physics: Foundations of Manufacturing Management (1996) (Richard D. Irwin, Chicago, IL) Google Scholar
  • Industrial Engineering Competition in manufacturing leads to MRP II. (1991) 23(July):10–13Google Scholar
  • Ioffe A. D., Tihomirov V. M.Theory of Extremal Problems (1979) (North-Holland, Amsterdam, The Netherlands) Google Scholar
  • Karmarkar U. S. Lot sizes, lead times and in-process inventories. Management Sci. (1987) 33(3):409–423LinkGoogle Scholar
  • Karmarkar U. S., Kekre S., Freeman S. Lot-sizing and lead-time performance in a manufacturing cell. Interfaces (1985) 15(2):1–9LinkGoogle Scholar
  • Karni R. Capacity requirements planning—A systematization. Internat. J. Prod. Res. (1982) 20(6):715–739CrossrefGoogle Scholar
  • Kushner H. J., Clark D. S.Stochastic Approximation Methods for Constrained and Unconstrained Systems (1978) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Plambeck E. L., Fu B. R., Robinson S. M., Suri R., Schoen J. M. Throughput optimization in tandem production lines via nonsmooth programming. Proc. 1993 Summer Comput. Simulation Conf. (1993) Society for Computer Simulation, San Diego, CA:70–75Google Scholar
  • Plambeck E. L. Sample-path optimization of convex stochastic performance functions. Math. Programming (1996) 75(2):137–176CrossrefGoogle Scholar
  • Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) CrossrefGoogle Scholar
  • Rockafellar R. T. Integrals which are convex functionals. Pacific J. Math (1968) 24:867–873CrossrefGoogle Scholar
  • Rockafellar R. T., Wets R. J.-B. On the interchange of subdifferentiation and conditional expectation for convex functionals. Stochastics (1982) 7:173–182CrossrefGoogle Scholar
  • Rubinstein R. Y., Shapiro A.Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method (1993) (John Wiley & Sons, New York) Google Scholar
  • Saboo S., Wang L., Wilheim W. E. Recursion models for describing and managing the transient flow of materials in generalized flowlines. Management Sci. (1989) 35(6):722–742LinkGoogle Scholar
  • Shapiro A., Homem-de-Mello T. A simulation-based approach to stochastic programming with recourse. Math. Programming (1998) 81(3):301–325CrossrefGoogle Scholar
  • Spearman M. L., Zazanis M. A. Push and pull production systems: Issues and comparisons. Oper. Res. (1992) 40:521–532LinkGoogle Scholar
  • Vollmann T. E., Berry W. L., Whybark D. C.Manufacturing Planning and Control Systems (1988) 2nd ed.(Richard D. Irwin, Homewood, IL) Google 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.