Solving group interval scheduling efficiently

DOI10.1007/978-3-030-25005-8_9MaRDI QIDQ2301736zbMATH OpenOpenAlexFDO

Authors Arindam Biswas, Venkatesh Raman, Saket Saurabh

Publication date 25 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-25005-8_9

zbMATH Keywords

graphhashjobintervalmultivariateparameterschedulinggrouprepresentativeFPTfixedindependentcolourful

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• The \(k\)-track assignment problem
• scientific article; zbMATH DE number 1877047
• Grouping techniques for scheduling problems: simpler and faster
• Interval selection with machine-dependent intervals
• Fixed interval scheduling: models, applications, computational complexity and algorithms

Cited in

(4)

• A group priority earliest deadline first scheduling algorithm
• Group-based Pfair scheduling
• Group scheduling on two cells with intercell movement
• scientific article; zbMATH DE number 1877047 (Why is no real title available?)

This page was built for publication: Solving group interval scheduling efficiently

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