Semi-online scheduling revisited
From MaRDI portal
Publication:442235
DOI10.1016/J.TCS.2012.03.031zbMATH Open1243.68093OpenAlexW2063410603MaRDI QIDQ442235FDOQ442235
Authors: Susanne Albers, Matthias Hellwig 
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.031
Recommendations
- Semi-online scheduling problems on a small number of machines
- A survey on makespan minimization in semi-online environments
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
- Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
- Lower bounds and semi on-line multiprocessor scheduling
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- On-line scheduling revisited
- Semi-on-line multiprocessor scheduling with given total processing time
- Bounds for Certain Multiprocessing Anomalies
- A better lower bound for on-line scheduling
- A lower bound for randomized on-line scheduling algorithms
- A lower bound for randomized on-line multiprocessor scheduling
- Title not available (Why is that?)
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- New algorithms for an ancient scheduling problem.
- Bin stretching revisited
- Semi on-line algorithms for the partition problem
- Semi-online scheduling on two uniform processors
- Better Bounds for Online Scheduling
- Improved Bounds for the Online Scheduling Problem
- The on-line multiprocessor scheduling problem with known sum of the tasks
- The Power of Reordering for Online Minimum Makespan Scheduling
- A Better Algorithm for an Ancient Scheduling Problem
- On-line bin-stretching
- On randomized online scheduling
- Semi-on-line scheduling on two parallel processors with an upper bound on the items
- Title not available (Why is that?)
- New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
Cited In (22)
- Title not available (Why is that?)
- Semi-online scheduling problems on a small number of machines
- Online bin packing with advice
- Semi-online scheduling on two identical parallel machines with initial-lookahead information
- Scheduling with testing on multiple identical parallel machines
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
- A two-phase algorithm for bin stretching with stretching factor 1.5
- A survey on makespan minimization in semi-online environments
- Online bin stretching with three bins
- Online early work maximization on three hierarchical machines with a common due date
- An efficient algorithm for bin stretching
- Bin stretching with migration on two hierarchical machines
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- Graceful Degradation in Semi-Clairvoyant Scheduling
- Semi-online scheduling: a survey
- Online bin stretching with bunch techniques
- Rejecting jobs to minimize load and maximum flow-time
- Dynamic scheduling of patients in emergency departments
- Dynamic programming optimization in line of sight networks
- Parallel solutions for preemptive makespan scheduling on two identical machines
This page was built for publication: Semi-online scheduling revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442235)
