Efficient job scheduling algorithms with multi-type contentions
From MaRDI portal
Publication:813335
DOI10.1007/s10878-005-2272-zzbMath1093.90013OpenAlexW2086181984MaRDI QIDQ813335
Jinhui Xu, Zhenming Chen, Vikas Vikram Singh
Publication date: 8 February 2006
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-005-2272-z
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling jobs with fixed start and end times
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines
- Improvements in throughout maximization for real-time scheduling
- Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines
- On randomized online scheduling
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- Bounds for Certain Multiprocessing Anomalies
- A unified approach to approximating resource allocation and scheduling
- A new average case analysis for completion time scheduling
