Minimizing flowtime for paired tasks

Brenda Courtad, Kenneth Baker, Michael Magazine and George Polak

European Journal of Operational Research, 2017, vol. 259, issue 3, 818-828

Abstract: Certain service and production systems require that a single processor complete, for each job, a pair of ordered tasks separated in time by a minimal required delay. In particular, circumstances, this mode of operation can characterize a physician in a hospital Emergency Department, a painting crew at a construction site, or a work station in a job shop. Motivated by these scenarios, we formulate an applicable scheduling problem and investigate its solution. To determine an optimal schedule, we formulate an appropriate mixed integer model in which the key lever for process improvement is the batching of tasks. We further show that two special cases of this problem can be optimally solved efficiently. To expedite decision-making, we propose heuristic approaches supported by spreadsheet based software. Numerical results are then presented and insights discussed.

Keywords: Heuristics; Scheduling/batching; Integer programing (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221716308451
Full text for ScienceDirect subscribers only

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:eee:ejores:v:259:y:2017:i:3:p:818-828

DOI: 10.1016/j.ejor.2016.10.012

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().