Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Balancing schedules using maximum leximin

From MaRDI portal
Publication:2297804
Jump to:navigation, search

DOI10.1007/978-3-030-29765-7_41OpenAlexW2972049408MaRDI QIDQ2297804FDOQ2297804


Authors: Federico Toffano, Nic Wilson Edit this on Wikidata


Publication date: 20 February 2020


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




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


zbMATH Keywords

preferencesfair divisionscheduling under uncertainty


Mathematics Subject Classification ID

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







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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2297804&oldid=14874463"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 2 February 2024, at 13:14. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki