Scheduling when you don't know the number of machines

MaRDI QIDQ4607970zbMATH OpenFDO

Authors Mingxian Zhong, Clifford Stein

Publication date 15 March 2018

Full work available at URL http://dl.acm.org/citation.cfm?id=3175352

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling when you do not know the number of machines
• Speed-robust scheduling. Sand, bricks, and rocks
• Robust scheduling with budgeted uncertainty
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• Single machine scheduling with scenarios

Cited in

(5)

• Scheduling with a minimum number of machines
• Speed-robust scheduling: sand, bricks, and rocks
• Scheduling when you do not know the number of machines
• Robustly assigning unstable items
• Scheduling with unexpected machine breakdowns

This page was built for publication: Scheduling when you don't know the number of machines

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