IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i2p1310-1334.html
   My bibliography  Save this article

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
    ---><---

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.