Total completion time scheduling under scenarios

DOI10.1007/S00224-025-10232-ZMaRDI QIDQ6911397zbMATH OpenFDO

Authors Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, L. Stougie

Publication date 24 October 2025

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

complexityscenariosmachine schedulingtotal completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

This page was built for publication: Total completion time scheduling under scenarios

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