Comparing deterministic, robust and online scheduling using entropy

DOI10.1080/00207540412331333405MaRDI QIDQ4681156zbMATH OpenOpenAlexFDO

Authors 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

deterministicentropyonlinerobustscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On robust online scheduling algorithms
• Stochastic Online Scheduling Revisited
• On the Robustness of Graham’s Algorithm for Online Scheduling
• Online scheduling on multiple resources under stochastic conditions
• Models and Algorithms for Stochastic Online Scheduling
• Online Interval Scheduling: Randomized and Multiprocessor Cases
• Online interval scheduling: Randomized and multiprocessor cases
• A new approach to online scheduling: approximating the optimal competitive ratio
• A new approach to online scheduling: approximating the optimal competitive ratio
• On-line scheduling revisited

Cites work

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

Cited in

(1)

• Can entropy characterize performance of online algorithms?

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

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