IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v56y2008i5p1218-1237.html
   My bibliography  Save this article

Optimization Models of Discrete-Event System Dynamics

Author

Listed:
  • Wai Kin (Victor) Chan

    (Department of Decision Sciences and Engineering Systems, Rensselaer Polytechnic Institute, Troy, New York 12180)

  • Lee Schruben

    (Department of Industrial Engineering and Operations Research, University of California, Berkeley, California 94720)

Abstract

A methodology is given for modeling the dynamics of discrete-event stochastic systems as optimization problems. The intent is to provide a means to utilize the rich mathematical theory and algorithms of optimization in the study of this important class of systems. A procedure for mapping a simulation event relationship graph into a mixed-integer program is presented, along with examples of queueing networks and manufacturing systems that illustrate the approach. Several potential applications are examined, including automatic constraint generation for optimal resource scheduling, representations of max-plus algebra models for queueing system dynamics, response gradient estimation, and an unconventional technique for simulating queueing systems using virtual resources that are identified from the optimization models for these systems.

Suggested Citation

  • Wai Kin (Victor) Chan & Lee Schruben, 2008. "Optimization Models of Discrete-Event System Dynamics," Operations Research, INFORMS, vol. 56(5), pages 1218-1237, October.
    • Handle: RePEc:inm:oropre:v:56:y:2008:i:5:p:1218-1237
    DOI: 10.1287/opre.1080.0559
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1080.0559
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1080.0559?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. George Liberopoulos & Yves Dallery, 2000. "A unified framework for pull control mechanisms in multi‐stage manufacturing systems," Annals of Operations Research, Springer, vol. 93(1), pages 325-355, January.
    2. Williams, H. P., 1995. "Logic applied to integer programming and integer programming applied to logic," European Journal of Operational Research, Elsevier, vol. 81(3), pages 605-616, March.
    3. Eginhard J. Muth, 1979. "The Reversibility Property of Production Lines," Management Science, INFORMS, vol. 25(2), pages 152-158, February.
    4. Rajan Suri & Michael A. Zazanis, 1988. "Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue," Management Science, INFORMS, vol. 34(1), pages 39-64, January.
    5. John N. Hooker, 2002. "Logic, Optimization, and Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 295-321, November.
    6. Eric L. Savage & Lee W. Schruben & Enver Yücesan, 2005. "On the Generality of Event-Graph Models," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 3-9, February.
    7. Tito Homem-de-Mello & Alexander Shapiro & Mark L. Spearman, 1999. "Finding Optimal Material Release Times Using Simulation-Based Optimization," Management Science, INFORMS, vol. 45(1), pages 86-102, January.
    8. Milind Dawande & Chelliah Sriskandarajah & Suresh Sethi, 2002. "On Throughput Maximization in Constant Travel-Time Robotic Cells," Manufacturing & Service Operations Management, INFORMS, vol. 4(4), pages 296-312, August.
    9. Dinah W. Cheng, 1995. "Line Reversibility of Tandem Queues with General Blocking," Management Science, INFORMS, vol. 41(5), pages 864-873, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Arianna Alfieri & Andrea Matta & Giulia Pedrielli, 2015. "Mathematical programming models for joint simulation–optimization applied to closed queueing networks," Annals of Operations Research, Springer, vol. 231(1), pages 105-127, August.
    2. Alfieri, Arianna & Matta, Andrea, 2013. "Mathematical programming time-based decomposition algorithm for discrete event simulation," European Journal of Operational Research, Elsevier, vol. 231(3), pages 557-566.
    3. George Liberopoulos, 2020. "Comparison of optimal buffer allocation in flow lines under installation buffer, echelon buffer, and CONWIP policies," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 297-365, June.
    4. S. Göttlich & S. Kühn & J. A. Schwarz & R. Stolletz, 2016. "Approximations of time-dependent unreliable flow lines with finite buffers," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(3), pages 295-323, June.
    5. Alfieri, Arianna & Matta, Andrea, 2012. "Mathematical programming formulations for approximate simulation of multistage production systems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 773-783.
    6. Alexander H. Gose & Brian T. Denton, 2016. "Sequential Bounding Methods for Two-Stage Stochastic Programs," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 351-369, May.

    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. Neil Geismar, H. & Dawande, Milind & Sriskandarajah, Chelliah, 2005. "Approximation algorithms for k-unit cyclic solutions in robotic cells," European Journal of Operational Research, Elsevier, vol. 162(2), pages 291-309, April.
    2. John N. Hooker, 2002. "Logic, Optimization, and Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 295-321, November.
    3. Matthias Thürer & Nuno O. Fernandes & Mark Stevenson & Cristovao Silva & Silvio Carmo-Silva, 2019. "POLC-A: an assessment of POLCA’s authorization element," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2435-2447, August.
    4. Kumar Satyam & Ananth Krishnamurthy, 2013. "Performance analysis of CONWIP systems with batch size constraints," Annals of Operations Research, Springer, vol. 209(1), pages 85-114, October.
    5. Tallys Yunes & Ionuţ D. Aron & J. N. Hooker, 2010. "An Integrated Solver for Optimization Problems," Operations Research, INFORMS, vol. 58(2), pages 342-356, April.
    6. Cigdem Gurgur, 2013. "Optimal configuration of a decentralized, market-driven production/inventory system," Annals of Operations Research, Springer, vol. 209(1), pages 139-157, October.
    7. Yannis Pavlis & Will Recker, 2009. "A Mathematical Logic Approach for the Transformation of the Linear Conditional Piecewise Functions of Dispersion-and-Store and Cell Transmission Traffic Flow Models into Linear Mixed-Integer Form," Transportation Science, INFORMS, vol. 43(1), pages 98-116, February.
    8. M. Hossein Safizadeh, 1990. "Optimization in simulation: Current issues and the future outlook," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 807-825, December.
    9. Amin Hosseininasab & Willem-Jan van Hoeve, 2021. "Exact Multiple Sequence Alignment by Synchronized Decision Diagrams," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 721-738, May.
    10. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    11. Schumacher, J.M., 1988. "Discrete events : Perspectives from system theory," Other publications TiSEM 655c7240-4f86-4a73-a59b-a, Tilburg University, School of Economics and Management.
    12. Yijie Peng & Michael C. Fu & Bernd Heidergott & Henry Lam, 2020. "Maximum Likelihood Estimation by Monte Carlo Simulation: Toward Data-Driven Stochastic Modeling," Operations Research, INFORMS, vol. 68(6), pages 1896-1912, November.
    13. Papadopoulos, H. T. & Vidalis, M. I., 2001. "Minimizing WIP inventory in reliable production lines," International Journal of Production Economics, Elsevier, vol. 70(2), pages 185-197, March.
    14. Shuming Wang & Yan-Fu Li & Tong Jia, 2020. "Distributionally Robust Design for Redundancy Allocation," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 620-640, July.
    15. Kamburowski, J., 1997. "The nature of simplicity of Johnson's algorithm," Omega, Elsevier, vol. 25(5), pages 581-584, October.
    16. Julia Pahl & Stefan Voß & David Woodruff, 2007. "Production planning with load dependent lead times: an update of research," Annals of Operations Research, Springer, vol. 153(1), pages 297-345, September.
    17. O'Connell, Neil & Yor, Marc, 2001. "Brownian analogues of Burke's theorem," Stochastic Processes and their Applications, Elsevier, vol. 96(2), pages 285-304, December.
    18. Marlin W. Ulmer & Barrett W. Thomas, 2019. "Enough Waiting for the Cable Guy—Estimating Arrival Times for Service Vehicle Routing," Transportation Science, INFORMS, vol. 53(3), pages 897-916, May.
    19. Enlu Zhou & Shalabh Bhatnagar, 2018. "Gradient-Based Adaptive Stochastic Search for Simulation Optimization Over Continuous Space," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 154-167, February.
    20. Hyoungtae Kim & Sungsoo Park, 1999. "Optimality of the Symmetric Workload Allocation in a Single-Server Flow Line System," Management Science, INFORMS, vol. 45(3), pages 449-451, March.

    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:inm:oropre:v:56:y:2008:i:5:p:1218-1237. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.