Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms

DOI10.1016/j.dam.2024.06.031zbMath1547.90076MaRDI QIDQ6611071

Unnamed Author, Tabea Brandt, Christina Büsing, Tobias Mömke

Publication date: 26 September 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmsinterval scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

This page was built for publication: Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms