Optimal Workflow Decisions for Investigators in Systems with Interruptions

Gregory Dobson (), Tolga Tezcan () and Vera Tilson ()
Additional contact information
Gregory Dobson: Simon School of Business, University of Rochester, Rochester, New York 14617
Tolga Tezcan: Simon School of Business, University of Rochester, Rochester, New York 14617
Vera Tilson: Simon School of Business, University of Rochester, Rochester, New York 14617

Management Science, 2013, vol. 59, issue 5, 1125-1141

Abstract: We model a system that consists of a stream of customers processed through three steps by two resources. The first resource, an investigator, handles the first step, in which she collects information from the customer and decides what work will be done in the second step by the second resource, the back office. In the third step, the investigator returns to the customer armed with the additional information or analysis done by the back office and provides the customer with a conclusion, solution, or diagnosis. The investigator has to prioritize either seeing a new customer or completing the work with a customer already in the system. While serving one customer, the investigator may be interrupted by requests from the other customers in the system. Our main objective is to understand the impact of the investigator's choices on system throughput. In addition, we are interested in the occupancy of the system (and thus the flow time of customers). We create a stylized queueing model to examine the investigator's decisions and show that, when interruptions are not an issue, the investigator should prioritize new customers to maximize throughput, keeping the system as full as possible. If customers who have been in the system for a long time generate interruptions and thus additional work for the investigator, we show that it is asymptotically optimal for the investigator to keep the system occupancy low and prioritize discharging customers. Our conclusions are based on a model of a re-entrant queue with dedicated servers serving multiple stations, with two novel features: a buffer that is shared between stations, and jobs in the system generating additional work for the servers. This paper was accepted by Assaf Zeevi, stochastic models and simulation.

Keywords: dynamic programming; optimal control; Markov; healthcare; hospitals; probability; Markov processes; stochastic; queues; limit theorems (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.1120.1632 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:59:y:2013:i:5:p:1125-1141

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().