Technical Note—Stochastic Scheduling with Abandonment: Necessary and Sufficient Conditions for the Optimality of a Strict Priority Policy
Gang Chen (),
Jean-Philippe Gayon () and
Pierre Lemaire ()
Additional contact information
Gang Chen: School of Management, Guangzhou University, Guangzhou 510006, China
Jean-Philippe Gayon: Université Clermont-Auvergne, CNRS, Mines de Saint-Étienne, Clermont-Auvergne-INP, LIMOS, 63000 Clermont-Ferrand, France
Pierre Lemaire: Univ. Grenoble Alpes, CNRS, Grenoble INP, G-SCOP, 38000 Grenoble, France
Operations Research, 2023, vol. 71, issue 5, 1789-1793
Abstract:
We consider a stochastic scheduling problem in clearing systems with two types of jobs, each characterized by a general service time distribution, an exponentially distributed lifetime, and a reward. A job abandons the system if its waiting time in the queue is larger than its lifetime. Preemption is not allowed. The objective is to maximize the total expected reward. When service times are homogeneous, we provide a set of necessary and sufficient conditions for the optimality of a strict priority policy. When service times are heterogeneous and exponentially distributed, we conjecture a set of necessary conditions, which would also be sufficient when one parameter is identical (reward or lifetime rate) for the two types of jobs.
Keywords: Stochastic Models; stochastic scheduling; abandonment; strict priority policy; dynamic programming (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://dx.doi.org/10.1287/opre.2022.2285 (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:oropre:v:71:y:2023:i:5:p:1789-1793
Access Statistics for this article
More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().