Interval selection with machine-dependent intervals

DOI10.1007/978-3-642-40104-6_15MaRDI QIDQ2842155zbMATH OpenOpenAlexFDO

Authors Kateřina Böhmová, Y. Disser, Matúš Mihalák, Peter Widmayer

Publication date 12 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/20.500.11850/76420

zbMATH Keywords

approximationcomplexityintervalsscheduling

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximating interval selection on unrelated machines with unit-length intervals and cores
• Interval scheduling on related machines
• Interval scheduling on identical machines
• The k-track assignment problem
• Fixed interval scheduling: models, applications, computational complexity and algorithms

Cited in

(11)

• The k-track assignment problem
• Inverse interval scheduling via reduction on a single machine
• Solving group interval scheduling efficiently
• Approximating interval selection on unrelated machines with unit-length intervals and cores
• Strip Graphs: Recognition and Scheduling
• Interval scheduling: A survey
• No-wait scheduling for locks
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Interval scheduling on related machines
• Fixed interval scheduling with third‐party machines
• Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms

This page was built for publication: Interval selection with machine-dependent intervals

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