Recommendations
Cites work
- An improved randomized on-line algorithm for a weighted interval selection problem
- An optimal real-time algorithm for planar convex hulls
- Bounding the Power of Preemption in Randomized Scheduling
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- Improved Randomized Results for That Interval Selection Problem
- Interval scheduling on identical machines
- Interval scheduling: A survey
- Note on scheduling intervals on-line
- On the \(k\)-coloring of intervals
- On-line scheduling of jobs with fixed start and end times
- Online interval scheduling: Randomized and multiprocessor cases
- Randomized online interval scheduling
- Scheduling jobs with fixed start and end times
Cited in
(24)- Online interval scheduling with a bounded number of failures
- Online C-benevolent job scheduling on multiple machines
- Competitive algorithms for multistage online scheduling
- Matching supply and demand in a sharing economy: classification, computational complexity, and application
- Online interval scheduling to maximize total satisfaction
- Online interval scheduling on two related machines: the power of lookahead
- Interval scheduling on identical machines
- Online scheduling of jobs with fixed start times on related machines
- Approximating interval selection on unrelated machines with unit-length intervals and cores
- Interval selection with machine-dependent intervals
- Online optimization of busy time on parallel machines. (Extended abstract)
- A triplet-based exact method for the shift minimisation personnel task scheduling problem
- Online splitting interval scheduling on m identical machines
- On-line scheduling of equal-length intervals on parallel machines
- Online optimization of busy time on parallel machines
- No-wait scheduling for locks
- Interval scheduling maximizing minimum coverage
- Computing and Combinatorics
- Online Interval Scheduling to Maximize Total Satisfaction
- Fixed interval scheduling with third‐party machines
- Bag-Of-Tasks Scheduling on Related Machines
- On the parameterized complexity of interval scheduling with eligible machine sets
- Single-machine scheduling to minimize the number of tardy jobs with release dates
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
This page was built for publication: Interval scheduling on related machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547142)
