Optimal static priority rules for stochastic scheduling with impatience
From MaRDI portal
Publication:2376741
DOI10.1016/J.ORL.2012.11.008zbMATH Open1266.90111OpenAlexW2088603616MaRDI QIDQ2376741FDOQ2376741
Authors: A. Salch, Jean-Philippe Gayon, Pierre Lemaire 
Publication date: 24 June 2013
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2012.11.008
Recommendations
- On the optimality of static priority policies in stochastic scheduling on parallel machines
- Scheduling stochastic jobs with due dates on parallel machines
- On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines
- A stochastic single machine scheduling with random processing time
- Dynamic scheduling of stochastic jobs on a single machine
stochastic schedulingimpatience to the beginning of serviceimpatience to the end of servicestatic priority rules
Cited In (9)
- Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
- An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
- Multiple server preemptive scheduling with impatience
- A sequential scheduling problem with impatient jobs
- Technical Note—Stochastic Scheduling with Abandonment: Necessary and Sufficient Conditions for the Optimality of a Strict Priority Policy
- Two‐class constrained optimization with applications to queueing control
- \(K\) competing queues with customer abandonment: optimality of a generalised \(c \mu \)-rule by the smoothed rate truncation method
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing
- Title not available (Why is that?)
This page was built for publication: Optimal static priority rules for stochastic scheduling with impatience
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376741)
