Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices

DOI10.1287/OPRE.42.4.669MaRDI QIDQ4319755zbMATH OpenOpenAlexFDO

Authors Uriel G. Rothblum, Michael H. Rothkopf

Publication date 12 January 1995

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.42.4.669

zbMATH Keywords

dynamic recalculation of priority indicesindex-based policiessequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• A note on the optimality of index priority rules for search and sequencing problems
• Technical Note—On Rothkopf and Smith's Statement Regarding Optimal Priority Assignment
• On index priority sequencing rules for scheduling with time-dependent job processing times
• Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule

Cited in

(2)

• On index priority sequencing rules for scheduling with time-dependent job processing times
• A note on the optimality of index priority rules for search and sequencing problems

This page was built for publication: Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4319755)