Balancing schedules using maximum leximin

DOI10.1007/978-3-030-29765-7_41MaRDI QIDQ2297804zbMATH OpenOpenAlexFDO

Authors Federico Toffano, Nic Wilson

Publication date 20 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-29765-7_41

zbMATH Keywords

preferencesfair divisionscheduling under uncertainty

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Scheduling to Minimize Maximum Workload
• An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems
• A particular timetable problem: terminal scheduling
• Proportional optimization and fairness
• Fairness in Scheduling

This page was built for publication: Balancing schedules using maximum leximin

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