IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i2p1310-1334.html

Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources

Author

Listed:
  • Erhun Özkan

    (College of Administrative Sciences and Economics, Koç University, Istanbul 34450, Turkey)

Abstract

A fork-join processing network is a queueing network in which tasks associated with a job can be processed simultaneously. Fork-join processing networks are prevalent in computer systems, healthcare, manufacturing, project management, justice systems, and so on. Unlike the conventional queueing networks, fork-join processing networks have synchronization constraints that arise because of the parallel processing of tasks and can cause significant job delays. We study scheduling in fork-join processing networks with multiple job types and parallel shared resources. Jobs arriving in the system fork into arbitrary number of tasks, then those tasks are processed in parallel, and then they join and leave the network. There are shared resources processing multiple job types. We study the scheduling problem for those shared resources (i.e., which type of job to prioritize at any given time) and propose an asymptotically optimal scheduling policy in diffusion scale.

Suggested Citation

  • Erhun Özkan, 2022. "Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1310-1334, May.
    • Handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:1310-1334
    DOI: 10.1287/moor.2021.1170
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1170
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2021.1170?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. Hongyuan Lu & Guodong Pang, 2016. "Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 560-595, May.
    2. Avishai Mandelbaum & Alexander L. Stolyar, 2004. "Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule," Operations Research, INFORMS, vol. 52(6), pages 836-855, December.
    3. Paul S. Adler & Avi Mandelbaum & Viên Nguyen & Elizabeth Schwerer, 1995. "From Project to Process Management: An Empirically-Based Framework for Analyzing Product Development Time," Management Science, INFORMS, vol. 41(3), pages 458-484, March.
    4. Martin I. Reiman & Qiong Wang, 2015. "Asymptotically Optimal Inventory Control for Assemble-to-Order Systems with Identical Lead Times," Operations Research, INFORMS, vol. 63(3), pages 716-732, June.
    5. Erhun Özkan & Amy R. Ward, 2019. "On the Control of Fork-Join Networks," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 532-564, May.
    6. Hongyuan Lu & Guodong Pang, 2017. "Heavy-traffic limits for an infinite-server fork–join queueing system with dependent and disruptive services," Queueing Systems: Theory and Applications, Springer, vol. 85(1), pages 67-115, February.
    7. Richard C. Larson & Michael F. Cahn & Martin C. Shell, 1993. "Improving the New York City Arrest-to-Arraignment System," Interfaces, INFORMS, vol. 23(1), pages 76-96, February.
    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. Dennis Schol & Maria Vlasiou & Bert Zwart, 2025. "Extreme values for the waiting time in large fork-join queues," Queueing Systems: Theory and Applications, Springer, vol. 109(1), pages 1-26, March.
    2. R. Bekker & B. Bharti & M. Mandjes, 2025. "Appointment Scheduling for Parallel Queues," Methodology and Computing in Applied Probability, Springer, vol. 27(4), pages 1-31, December.

    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. Erhun Özkan & Amy R. Ward, 2019. "On the Control of Fork-Join Networks," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 532-564, May.
    2. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
    3. Achal Bassamboo & J. Michael Harrison & Assaf Zeevi, 2006. "Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method," Operations Research, INFORMS, vol. 54(3), pages 419-435, June.
    4. Smith, Robert P. & Eppinger, Steven D., 1991. "Identifying controlling features of engineering design iteration," Working papers 3348-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    5. Lijian Lu & Jing‐Sheng Song & Hanqin Zhang, 2015. "Optimal and asymptotically optimal policies for assemble‐to‐order n‐ and W‐systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(8), pages 617-645, December.
    6. Gabriel Zayas‐Cabán & Emmett J. Lodree & David L. Kaufman, 2020. "Optimal Control of Parallel Queues for Managing Volunteer Convergence," Production and Operations Management, Production and Operations Management Society, vol. 29(10), pages 2268-2288, October.
    7. Willem van Jaarsveld & Alan Scheller-Wolf, 2015. "Optimization of Industrial-Scale Assemble-to-Order Systems," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 544-560, August.
    8. Guha, Mahua & Das, Gopal, 2017. "Routine contraction in good times: An example of a typical prototype development routine," Journal of Business Research, Elsevier, vol. 70(C), pages 145-152.
    9. Karan Girotra & Christian Terwiesch & Karl T. Ulrich, 2007. "Valuing R& D Projects in a Portfolio: Evidence from the Pharmaceutical Industry," Management Science, INFORMS, vol. 53(9), pages 1452-1466, September.
    10. Kuang Xu & Yuan Zhong, 2020. "Information and Memory in Dynamic Resource Allocation," Operations Research, INFORMS, vol. 68(6), pages 1698-1715, November.
    11. Hongseok Namkoong & Yuanzhe Ma & Peter W. Glynn, 2026. "Minimax Optimal Estimation of Stability Under Distribution Shift," Operations Research, INFORMS, vol. 74(1), pages 464-483, January.
    12. Wanyang Dai, 2013. "Optimal Rate Scheduling via Utility-Maximization for J -User MIMO Markov Fading Wireless Channels with Cooperation," Operations Research, INFORMS, vol. 61(6), pages 1450-1462, December.
    13. Yossi Luzon & Opher Baron & Vedat Verter & Oded Berman, 2025. "On Designing a Fire Emergency Vehicle Fleet," Manufacturing & Service Operations Management, INFORMS, vol. 27(6), pages 1995-2015, November.
    14. Talla Nobibon, Fabrice & Leus, Roel & Nip, Kameng & Wang, Zhenbo, 2015. "Resource loading with time windows," European Journal of Operational Research, Elsevier, vol. 244(2), pages 404-416.
    15. Saltzman, Robert M., 2020. "Improving the voir dire process: A prospective juror's perspective," Socio-Economic Planning Sciences, Elsevier, vol. 70(C).
    16. Rami Atar & Subhamay Saha, 2017. "Optimality of the generalized $$\varvec{c\mu }$$ c μ rule in the moderate deviation regime," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 113-130, October.
    17. Azaron, Amir & Fynes, Brian & Modarres, Mohammad, 2011. "Due date assignment in repetitive projects," International Journal of Production Economics, Elsevier, vol. 129(1), pages 79-85, January.
    18. Antonio J. Conejo & Nicholas G. Hall & Daniel Zhuoyu Long & Runhao Zhang, 2021. "Robust Capacity Planning for Project Management," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1533-1550, October.
    19. Gregory Dobson & Tolga Tezcan & Vera Tilson, 2013. "Optimal Workflow Decisions for Investigators in Systems with Interruptions," Management Science, INFORMS, vol. 59(5), pages 1125-1141, May.
    20. Merve Bodur & James R. Luedtke, 2017. "Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty," Management Science, INFORMS, vol. 63(7), pages 2073-2091, July.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    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:inm:ormoor:v:47:y:2022:i:2:p:1310-1334. 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.