Comparing deterministic, robust and online scheduling using entropy

DOI10.1080/00207540412331333405zbMath1090.90081OpenAlexW2018395163MaRDI QIDQ4681156

Heng-Soon Gan, Andrew Wirth

Publication date: 14 June 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540412331333405

zbMATH Keywords

robustentropyschedulingdeterministiconline

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• On the robust single machine scheduling problem
• On the calculation of the stability radius of an optimal or an approximate schedule
• A game-theoretic control approach for job shops in the presence of disruptions
• Stability of Johnson's schedule with respect to limited machine availability
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production

This page was built for publication: Comparing deterministic, robust and online scheduling using entropy