IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v63y2000i3p267-275.html
   My bibliography  Save this article

A multi-grid size dynamic programming approach for the production control of a random-speed machine

Author

Listed:
  • So, Wai Ping
  • Wan, Yat-wah

Abstract

No abstract is available for this item.

Suggested Citation

  • So, Wai Ping & Wan, Yat-wah, 2000. "A multi-grid size dynamic programming approach for the production control of a random-speed machine," International Journal of Production Economics, Elsevier, vol. 63(3), pages 267-275, January.
    • Handle: RePEc:eee:proeco:v:63:y:2000:i:3:p:267-275
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(99)00021-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Golenko-Ginzburg, Dmitri & Sinuany-Stern, Zilla & Friedman, Lea, 1989. "Feeding parts with random production speed to an assembly line," Engineering Costs and Production Economics, Elsevier, vol. 16(2), pages 91-96, April.
    2. Ward Whitt, 1979. "Approximations of Dynamic Programs, II," Mathematics of Operations Research, INFORMS, vol. 4(2), pages 179-185, May.
    3. Sinuany-Stern, Zilla & Golenko-Ginzburg, Dimitri & Keren, Baruch, 1993. "On-line production control using the EVPI approach," European Journal of Operational Research, Elsevier, vol. 67(3), pages 344-357, June.
    4. Ward Whitt, 1978. "Approximations of Dynamic Programs, I," Mathematics of Operations Research, INFORMS, vol. 3(3), pages 231-243, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Robert Kirkby Author-Email: robertkirkby@gmail.com|, 2017. "Convergence of Discretized Value Function Iteration," Computational Economics, Springer;Society for Computational Economics, vol. 49(1), pages 117-153, January.
    2. Runggaldier, Wolfgang J., 1998. "Concepts and methods for discrete and continuous time control under uncertainty," Insurance: Mathematics and Economics, Elsevier, vol. 22(1), pages 25-39, May.
    3. Anton J. Kleywegt & Vijay S. Nori & Martin W. P. Savelsbergh, 2004. "Dynamic Programming Approximations for a Stochastic Inventory Routing Problem," Transportation Science, INFORMS, vol. 38(1), pages 42-70, February.
    4. William B. Haskell & Rahul Jain & Dileep Kalathil, 2016. "Empirical Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 402-429, May.
    5. Naci Saldi & Serdar Yüksel & Tamás Linder, 2017. "On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 945-978, November.
    6. Jie Ning & Matthew J. Sobel, 2019. "Easy Affine Markov Decision Processes," Operations Research, INFORMS, vol. 67(6), pages 1719-1737, November.
    7. Nicola Secomandi & François Margot, 2009. "Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 57(1), pages 214-230, February.
    8. Knolmayer, Gerhard, 1981. "A simulation study of simplification strategies in the development of optimization models," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 96, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Michael Z. Spivey & Warren B. Powell, 2004. "The Dynamic Assignment Problem," Transportation Science, INFORMS, vol. 38(4), pages 399-419, November.
    10. Dijk, N.M. van, 1989. "Truncation of Markov decision problems with a queueing network overflow control application," Serie Research Memoranda 0065, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    11. Golenko-Ginzburg, Dimitri & Sinuany-Stern, Zilla & Kats, Vladimir, 1996. "A multilevel decision-making system with multiple resources for controlling cotton harvesting," International Journal of Production Economics, Elsevier, vol. 46(1), pages 55-63, December.
    12. N. M. Van Dijk & K. Sladký, 1999. "Error Bounds for Nonnegative Dynamic Models," Journal of Optimization Theory and Applications, Springer, vol. 101(2), pages 449-474, May.
    13. Silvia Florio & Wolfgang Runggaldier, 1999. "On hedging in finite security markets," Applied Mathematical Finance, Taylor & Francis Journals, vol. 6(3), pages 159-176.
    14. Mabel M. TIDBALL & Eitan ALTMAN, 1994. "Approximations In Dynamic Zero-Sum Games," Game Theory and Information 9401001, University Library of Munich, Germany.
    15. Richard T. Boylan & Bente Villadsen, "undated". "A Bellman's Equation for the Study of Income Smoothing," Computing in Economics and Finance 1996 _009, Society for Computational Economics.
    16. Dijk, N.M. van, 1988. "Truncation of Markov chains with applications to queueing," Serie Research Memoranda 0053, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    17. Benjamin Van Roy, 2006. "Performance Loss Bounds for Approximate Value Iteration with State Aggregation," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 234-244, May.
    18. Insoon Yang, 2020. "A Convex Optimization Approach to Dynamic Programming in Continuous State and Action Spaces," Journal of Optimization Theory and Applications, Springer, vol. 187(1), pages 133-157, October.
    19. Dijk, N.M. van, 1989. "The importance of bias-terms for error bounds and comparison results," Serie Research Memoranda 0036, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    20. Dimitri, Golenko-Ginzburg & Shimon, Sitniakovski & Ljubisa, Papic, 2001. "A simulation factory control model under a chance constraint," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 57(1), pages 5-18.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:63:y:2000:i:3:p:267-275. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.