Can I read Interval Scheduling Complexity Analysis on EtoBox?
Interval Scheduling Complexity Analysis by Ammar Oulamara is a document available to read on EtoBox.
What is Interval Scheduling Complexity Analysis about?
The document discusses the complexity of the Feasible Interval Scheduling with a Resource Constraint (FISRC) problem, which involves scheduling jobs on parallel machines with limited resources. It establishes that FISRC is strongly NP-complete for fixed resource values R ≥ 2, while also presenting an algorithm that can solve it in O(n log n) time when the number of machines and resources are fixed. The paper connects FISRC to existing scheduling problems and outlines its implications in real-world scenarios
- Author
- Ammar Oulamara
- Language
- EN