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

Class dependent departure process from multiclass phase queues: Exact and approximate analyses

Author

Listed:
  • Dasu, Sriram

Abstract

No abstract is available for this item.

Suggested Citation

  • Dasu, Sriram, 1998. "Class dependent departure process from multiclass phase queues: Exact and approximate analyses," European Journal of Operational Research, Elsevier, vol. 108(2), pages 379-404, July.
    • Handle: RePEc:eee:ejores:v:108:y:1998:i:2:p:379-404
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00099-4
    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. Gabriel R. Bitran & Devanath Tirupati, 1988. "Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference," Management Science, INFORMS, vol. 34(1), pages 75-100, January.
    2. Susan L. Albin, 1984. "Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues," Operations Research, INFORMS, vol. 32(5), pages 1133-1162, October.
    3. Ward Whitt, 1988. "A Light-Traffic Approximation for Single-Class Departure Processes from Multi-Class Queues," Management Science, INFORMS, vol. 34(11), pages 1333-1346, November.
    4. Gagan L. Choudhury & David M. Lucantoni, 1996. "Numerical Computation of the Moments of a Probability Distribution from its Transform," Operations Research, INFORMS, vol. 44(2), pages 368-381, April.
    5. S. Suresh & W. Whitt, 1990. "Arranging Queues in Series: A Simulation Experiment," Management Science, INFORMS, vol. 36(9), pages 1080-1091, September.
    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. Kim, Sunkyo, 2004. "The heavy-traffic bottleneck phenomenon under splitting and superposition," European Journal of Operational Research, Elsevier, vol. 157(3), pages 736-745, September.
    2. Rabta, Boualem, 2013. "A hybrid method for performance analysis of G/G/m queueing networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 89(C), pages 38-49.
    3. Ishfaq, Rafay & Sox, Charles R., 2012. "Design of intermodal logistics networks with hub delays," European Journal of Operational Research, Elsevier, vol. 220(3), pages 629-641.
    4. Sohner, Volkmar & Schneeweiss, Christoph, 1995. "Hierarchically integrated lot size optimization," European Journal of Operational Research, Elsevier, vol. 86(1), pages 73-90, October.
    5. Pradhan, Salil & Damodaran, Purushothaman & Srihari, Krishnaswami, 2008. "Predicting performance measures for Markovian type of manufacturing systems with product failures," European Journal of Operational Research, Elsevier, vol. 184(2), pages 725-744, January.
    6. Girish, Muckai K. & Hu, Jian-Qiang, 2000. "Higher order approximations for the single server queue with splitting, merging and feedback," European Journal of Operational Research, Elsevier, vol. 124(3), pages 447-467, August.
    7. 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.
    8. Kris Lieckens & Nico Vandaele, 2016. "Differential evolution to solve the lot size problem in stochastic supply chain management systems," Annals of Operations Research, Springer, vol. 242(2), pages 239-263, July.
    9. Yang, Feng, 2010. "Neural network metamodeling for cycle time-throughput profiles in manufacturing," European Journal of Operational Research, Elsevier, vol. 205(1), pages 172-185, August.
    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. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    12. Kavusturucu, Ayse & Gupta, Surendra M., 1999. "Manufacturing systems with machine vacations, arbitrary topology and finite buffers," International Journal of Production Economics, Elsevier, vol. 58(1), pages 1-15, January.
    13. Opher Baron & Antonis Economou & Athanasia Manou, 2018. "The state-dependent M / G / 1 queue with orbit," Queueing Systems: Theory and Applications, Springer, vol. 90(1), pages 89-123, October.
    14. Yang, Feng & Liu, Jingang, 2012. "Simulation-based transfer function modeling for transient analysis of general queueing systems," European Journal of Operational Research, Elsevier, vol. 223(1), pages 150-166.
    15. Sunkyo Kim, 2011. "Modeling Cross Correlation in Three-Moment Four-Parameter Decomposition Approximation of Queueing Networks," Operations Research, INFORMS, vol. 59(2), pages 480-497, April.
    16. Bitran, Gabriel R. & Morabito, Reinaldo., 1995. "An overview of tradeoff curve analysis in the design of manufacturing systems," Working papers 3806-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    17. Roy, D. & de Koster, M.B.M., 2015. "Stochastic Modeling of Unloading and Loading Operations at a Container Terminal using Automated Lifting Vehicles," ERIM Report Series Research in Management ERS-2015-005-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    18. Bitran, Gabriel R. & Morabito, Reinaldo., 1994. "Open queueing networks : optimization and performance evaluation models for discrete manufacturing systems," Working papers 3743-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    19. Ward Whitt & Wei You, 2018. "Using Robust Queueing to Expose the Impact of Dependence in Single-Server Queues," Operations Research, INFORMS, vol. 66(1), pages 184-199, January.
    20. Sunkyo Kim, 2005. "Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 399-408, August.

    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:108:y:1998:i:2:p:379-404. 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.