IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v125y2000i1p84-92.html
   My bibliography  Save this article

New bounds for expected cycle times in tandem queues with blocking

Author

Listed:
  • Nakade, Koichi

Abstract

No abstract is available for this item.

Suggested Citation

  • Nakade, Koichi, 2000. "New bounds for expected cycle times in tandem queues with blocking," European Journal of Operational Research, Elsevier, vol. 125(1), pages 84-92, August.
    • Handle: RePEc:eee:ejores:v:125:y:2000:i:1:p:84-92
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00180-0
    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. Nico M. Van Dijk & Bernard F. Lamond, 1988. "Simple Bounds for Finite Single-Server Exponential Tandem Queues," Operations Research, INFORMS, vol. 36(3), pages 470-477, June.
    2. Eginhard J. Muth, 1979. "The Reversibility Property of Production Lines," Management Science, INFORMS, vol. 25(2), pages 152-158, February.
    3. Genji Yamazaki & Takeshi Kawashima & Hirotaka Sakasegawa, 1985. "Reversibility of Tandem Blocking Queueing Systems," Management Science, INFORMS, vol. 31(1), pages 78-83, January.
    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. 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.
    2. 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.
    3. 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.
    4. Steven J. Erlebacher & Medini R. Singh, 1999. "Optimal Variance Structures and Performance Improvement of Synchronous Assembly Lines," Operations Research, INFORMS, vol. 47(4), pages 601-618, August.
    5. Jeffrey M. Alden & Lawrence D. Burns & Theodore Costy & Richard D. Hutton & Craig A. Jackson & David S. Kim & Kevin A. Kohls & Jonathan H. Owen & Mark A. Turnquist & David J. Vander Veen, 2006. "General Motors Increases Its Production Throughput," Interfaces, INFORMS, vol. 36(1), pages 6-25, February.
    6. Ivo Adan & Gerard Hooghiemstra, 1998. "The M/M/c with critical jobs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 47(3), pages 341-353, October.
    7. Vincent W. Slaugh & Bahar Biller & Sridhar R. Tayur, 2016. "Managing Rentals with Usage-Based Loss," Manufacturing & Service Operations Management, INFORMS, vol. 18(3), pages 429-444, July.
    8. Xiang Zhong & Hyo Kyung Lee & Molly Williams & Sally Kraft & Jeffery Sleeth & Richard Welnick & Lori Hauschild & Jingshan Li, 2018. "Workload balancing: staffing ratio analysis for primary care redesign," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 6-29, June.
    9. 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.
    10. Kamburowski, Jerzy, 1999. "Stochastically minimizing the makespan in two-machine flow shops without blocking," European Journal of Operational Research, Elsevier, vol. 112(2), pages 304-309, January.
    11. Dijk, N.M. van & Korezlioglu, H., 1991. "On product form approximations for communication networks with losses : error bounds," Serie Research Memoranda 0011, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    12. Kozlowski, Dawid & Worthington, Dave, 2015. "Use of queue modelling in the analysis of elective patient treatment governed by a maximum waiting time policy," European Journal of Operational Research, Elsevier, vol. 244(1), pages 331-338.
    13. Waal, P.R. & Dijk, N.M. van, 1988. "Monotonicity of performance measures in a processor sharing queue," Serie Research Memoranda 0051, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    14. Dijk, N.M. van, 1989. "Sensitivity error bounds for non-exponental stochastic networks," Serie Research Memoranda 0093, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    15. Kamburowski, J., 1997. "The nature of simplicity of Johnson's algorithm," Omega, Elsevier, vol. 25(5), pages 581-584, October.
    16. 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.
    17. Suresh Chand & Ting Zeng, 2001. "A Comparison of U-Line and Straight-Line Performances Under Stochastic Task Times," Manufacturing & Service Operations Management, INFORMS, vol. 3(2), pages 138-150, January.
    18. Yu, Tae-Sun & Pinedo, Michael, 2020. "Flow shops with reentry: Reversibility properties and makespan optimal schedules," European Journal of Operational Research, Elsevier, vol. 282(2), pages 478-490.
    19. Benavides, Alexander J. & Vera, Antony, 2022. "The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 297(2), pages 407-421.
    20. Gultekin, Hakan, 2012. "Scheduling in flowshops with flexible operations: Throughput optimization and benefits of flexibility," International Journal of Production Economics, Elsevier, vol. 140(2), pages 900-911.

    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:ejores:v:125:y:2000:i:1:p:84-92. 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/eor .

    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.