Online C-benevolent job scheduling on multiple machines
From MaRDI portal
Publication:1744621
DOI10.1007/s11590-017-1191-0zbMath1403.90377OpenAlexW2754548199MaRDI QIDQ1744621
Publication date: 19 April 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1191-0
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Primal-dual analysis for online interval scheduling problems ⋮ Approximation algorithms for stochastic online matching with reusable resources ⋮ Online interval scheduling on two related machines: the power of lookahead
Cites Work
- Unnamed Item
- Unnamed Item
- Online scheduling of jobs with fixed start times on related machines
- On-line scheduling of equal-length intervals on parallel machines
- Interval scheduling on related machines
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Improved randomized results for the interval selection problem
- Online interval scheduling: Randomized and multiprocessor cases
- Scheduling jobs with fixed start and end times
- On the competitiveness of on-line real-time task scheduling
- Randomized online interval scheduling
- On-line scheduling of jobs with fixed start and end times
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines
- Note on scheduling intervals on-line
- Approximation schemes for scheduling on uniformly related and identical parallel machines
- Improved randomized online scheduling of intervals and jobs
- An improved randomized on-line algorithm for a weighted interval selection problem
- Approximating the Throughput of Multiple Machines in Real-Time Scheduling
- Interval selection: Applications, algorithms, and lower bounds
