Cardinality constrained scheduling in online models

DOI10.4230/LIPICS.STACS.2022.28MaRDI QIDQ6490975zbMATH OpenFDO

Authors Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder

Publication date 23 April 2024

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2022.28

zbMATH Keywords

cardinality constrained schedulinglower boundsmakespan minimizationmigrationonline algorithmsordinal algorithmspure online

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(5)

• Online cardinality constrained scheduling
• Scheduling with cardinality dependent unavailability periods
• More on online cardinality constrained bin packing with small cardinality bounds
• Makespan minimization for ordinal cardinality constrained scheduling
• Variants and objectives for ordinal scheduling

This page was built for publication: Cardinality constrained scheduling in online models

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