|M.Sc Student||Itamar Zaied|
|Subject||The Offered Load in Fork-Join Networks: Calculations and|
Applications to Service Engineering of Emergency
|Department||Department of Industrial Engineering and Management||Supervisors||Professor Emeritus Kaspi Haya|
|Full Professor Mandelbaum Avishai|
|Full Thesis text|
In this work, we develop tools to calculate the "Offered Load" of fork-join networks; we propose mathematical models, analytical approximations and, finally, a simulation methodology for validation and extensions beyond the analytically tractable.
A fork-join network is a queueing network where customers are identified with a collection of tasks that can be processed sequently and in parallel. The Offered Load is a function that represents the average amount of work within the system, as a function of time.
Fork-Join networks arise in many applications, and the one that motivated the present research is Emergency Departments (EDs): here patients fork into lab test, x-raying and physician check-ups which, ultimately, must all join in order for the medical process to continue.
We use our calculated Offered Load of ED to solve the capacity-sizing problem for various ED resources. Specifically, the Offered Load, combined with the "square root rule", are shown to reduce congestion in rush hours and stabilize key operation measures over time.