Scheduling with incompatible jobs
From MaRDI portal
Publication:1343141
DOI10.1016/0166-218X(94)90009-4zbMath0822.68011WikidataQ59567997 ScholiaQ59567997MaRDI QIDQ1343141
Gerhard J. Woeginger, Hans L. Bodlaender, Klaus Jansen
Publication date: 1 February 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel machines scheduling with nonsimultaneous machine available time
- Precoloring extension. I: Interval graphs
- Worst-Case Analysis of Heuristic Algorithms
- Performance Guarantees for Scheduling Algorithms
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies