Interval scheduling on related machines
DOI10.1016/J.COR.2011.03.001zbMATH Open1215.90029OpenAlexW2094561371WikidataQ57851420 ScholiaQ57851420MaRDI QIDQ547142FDOQ547142
Authors: Sven O. Krumke, Clemens Thielen, Stephan Westphal 
Publication date: 30 June 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.03.001
Recommendations
Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online interval scheduling: Randomized and multiprocessor cases
- Scheduling jobs with fixed start and end times
- Randomized online interval scheduling
- On-line scheduling of jobs with fixed start and end times
- Note on scheduling intervals on-line
- On the \(k\)-coloring of intervals
- Bounding the Power of Preemption in Randomized Scheduling
- Title not available (Why is that?)
- Interval scheduling: A survey
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Interval scheduling on identical machines
- Improved Randomized Results for That Interval Selection Problem
- An improved randomized on-line algorithm for a weighted interval selection problem
- An optimal real-time algorithm for planar convex hulls
Cited In (18)
- Online interval scheduling on two related machines: the power of lookahead
- Online scheduling of jobs with fixed start times on related machines
- Interval scheduling on identical machines
- On the parameterized complexity of interval scheduling with eligible machine sets
- On-line scheduling of equal-length intervals on parallel machines
- Matching supply and demand in a sharing economy: classification, computational complexity, and application
- Online Optimization of Busy Time on Parallel Machines
- Online C-benevolent job scheduling on multiple machines
- A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem
- Competitive algorithms for multistage online scheduling
- Fixed interval scheduling with third‐party machines
- Bag-Of-Tasks Scheduling on Related Machines
- Computing and Combinatorics
- Online optimization of busy time on parallel machines
- Online splitting interval scheduling on \(m\) identical machines
- Online Interval Scheduling to Maximize Total Satisfaction
- Online interval scheduling with a bounded number of failures
- No-Wait Scheduling for Locks
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)
