On the Control of Fork-Join Networks

Abstract

Networks in which the processing of jobs occurs both sequentially and in parallel are prevalent in many application domains, such as computer systems, healthcare, manufacturing, and project management. The parallel processing of jobs gives rise to synchronization constraints that can be a main reason for job delay. In comparison with feed-forward queueing networks that have only sequential processing of jobs, the approximation and control of networks that have synchronization constraints is less understood. One well-known modeling framework in which synchronization constraints are prominent is the fork-join processing network. Our objective is to find scheduling rules for fork-join processing networks with multiple job types in which there is first a fork operation, then activities that can be performed in parallel, and then a join operation. The difficulty is that some of the activities that can be performed in parallel require a shared resource. We solve the scheduling problem for that shared server (that is, which type of job to prioritize at any given time) when that server is in heavy traffic and prove an asymptotic optimality result. The e-companion is available at https://doi.org/10.1287/moor.2018.0935 .

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 14 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.