IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v41y2019i1d10.1007_s00291-018-0528-0.html
   My bibliography  Save this article

Analysis of a fork/join station with inputs from a finite population subnetwork with multi-server stations

Author

Listed:
  • Nico Goossens

    (UZ Brussel)

  • Ananth Krishnamurthy

    (University of Wisconsin-Madison)

  • Nico Vandaele

    (Katholieke Universiteit Leuven)

Abstract

Forks/join stations are commonly used to model synchronization constraints in queuing networks. This paper presents an exact analysis of a fork/join station with inputs from stations composed of multiple exponential servers. The queue length process at the input buffers is analyzed exactly using the underlying Markov process. The semi-Markov kernel characterizing the departure process is analyzed to derive expressions for the marginal and joint distributions of inter-departure times from the fork/join station. These analyses are used to study the effect of inputs from multiple servers on key performance measures at a fork/join station. Comparison studies show that inputs from multiple servers have a significant effect on performance measures such as throughput, synchronization delays and queue lengths at the individual buffers. These insights are important to obtain better representation of synchronization constraints in closed queuing network models of computer networks, fabrication/assembly systems and material control strategies for manufacturing systems.

Suggested Citation

  • Nico Goossens & Ananth Krishnamurthy & Nico Vandaele, 2019. "Analysis of a fork/join station with inputs from a finite population subnetwork with multi-server stations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 291-315, March.
    • Handle: RePEc:spr:orspec:v:41:y:2019:i:1:d:10.1007_s00291-018-0528-0
    DOI: 10.1007/s00291-018-0528-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-018-0528-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00291-018-0528-0?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
    ---><---

    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. Liu, Y. C. & Perros, H. G., 1991. "Approximate analysis of a closed fork/join model," European Journal of Operational Research, Elsevier, vol. 53(3), pages 382-392, August.
    2. Baynat, Bruno & Dallery, Yves, 1993. "Approximate techniques for general closed queueing networks with subnetworks having population constraints," European Journal of Operational Research, Elsevier, vol. 69(2), pages 250-264, September.
    3. Ananth Krishnamurthy & Rajan Suri & Mary Vernon, 2004. "Analysis of a Fork/Join Synchronization Station with Inputs from Coxian Servers in a Closed Queuing Network," Annals of Operations Research, Springer, vol. 125(1), pages 69-94, January.
    4. Maria Di Mascolo & Yannick Frein & Yves Dallery, 1996. "An Analytical Method for Performance Evaluation of Kanban Controlled Production Systems," Operations Research, INFORMS, vol. 44(1), pages 50-64, February.
    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. Erkut Sönmez & Alan Scheller-Wolf & Nicola Secomandi, 2017. "An Analytical Throughput Approximation for Closed Fork/Join Networks," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 251-267, May.
    2. Engin Topan & Zeynep Avṣar, 2011. "An approximation for kanban controlled assembly systems," Annals of Operations Research, Springer, vol. 182(1), pages 133-162, January.
    3. Matta, Andrea & Dallery, Yves & Di Mascolo, Maria, 2005. "Analysis of assembly systems controlled with kanbans," European Journal of Operational Research, Elsevier, vol. 166(2), pages 310-336, October.
    4. Tardif, Valerie & Maaseidvaag, Lars, 2001. "An adaptive approach to controlling kanban systems," European Journal of Operational Research, Elsevier, vol. 132(2), pages 411-424, July.
    5. Wilhelm, W. E. & Som, Pradip, 1998. "Analysis of a single-stage, single-product, stochastic, MRP-controlled assembly system," European Journal of Operational Research, Elsevier, vol. 108(1), pages 74-93, July.
    6. 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.
    7. 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.
    8. Wang, Shaojun & Sarker, Bhaba R., 2005. "An assembly-type supply chain system controlled by kanbans under a just-in-time delivery policy," European Journal of Operational Research, Elsevier, vol. 162(1), pages 153-172, April.
    9. Liberopoulos, George & Koukoumialos, Stelios, 2005. "Tradeoffs between base stock levels, numbers of kanbans, and planned supply lead times in production/inventory systems with advance demand information," International Journal of Production Economics, Elsevier, vol. 96(2), pages 213-232, May.
    10. Gaury, E.G.A. & Kleijnen, J.P.C. & Pierreval, H., 1998. "Customized Pull Systems for Single-Product Flow Lines," Discussion Paper 1998-117, Tilburg University, Center for Economic Research.
    11. Roy, Debjit & van Ommeren, Jan-Kees & de Koster, René & Gharehgozli, Amir, 2022. "Modeling landside container terminal queues: Exact analysis and approximations," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 73-102.
    12. Mark Vroblefski & R. Ramesh & Stanley Zionts, 2000. "General Open and Closed Queueing Networks with Blocking: A Unified Framework for Approximation," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 299-316, November.
    13. Park, Chan-Woo & Lee, Hyo-Seong, 2013. "Performance evaluation of a multi-product CONWIP assembly system with correlated external demands," International Journal of Production Economics, Elsevier, vol. 144(1), pages 334-344.
    14. Zhao Xiaobo & Qiguo Gong & Kenichi Nakashima, 2001. "Analysis of a production system in a general configuration," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(2), pages 128-143, March.
    15. Duri, Christelle & Frein, Yannick & Lee, Hyo-Seong, 2000. "Performance evaluation and design of a CONWIP system with inspections," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 219-229, March.
    16. Corrado Cuccurullo & Massimo Aria & Fabrizia Sarto, 2016. "Foundations and trends in performance management. A twenty-five years bibliometric analysis in business and public administration domains," Scientometrics, Springer;Akadémiai Kiadó, vol. 108(2), pages 595-611, August.
    17. Wang, Shaojun & Sarker, Bhaba R., 2006. "Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy," European Journal of Operational Research, Elsevier, vol. 172(1), pages 179-200, July.
    18. Iwase, Masaharu & Ohno, Katsuhisa, 2011. "The performance evaluation of a multi-stage JIT production system with stochastic demand and production capacities," European Journal of Operational Research, Elsevier, vol. 214(2), pages 216-222, October.
    19. Cigdem Z. Gurgur & Tayfur Altiok, 2007. "Analysis of decentralized multi‐product pull systems with lost sales," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(4), pages 357-370, June.
    20. Huang, Min & Wang, Dingwei & Ip, W. H., 1998. "Simulation study of CONWIP for a cold rolling plant," International Journal of Production Economics, Elsevier, vol. 54(3), pages 257-266, May.

    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:spr:orspec:v:41:y:2019:i:1:d:10.1007_s00291-018-0528-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.