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
Cites work
- A Better Algorithm for an Ancient Scheduling Problem
- A better lower bound for on-line scheduling
- A lower bound for randomized on-line multiprocessor scheduling
- A lower bound for randomized on-line scheduling algorithms
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Better Bounds for Online Scheduling
- Bin stretching revisited
- Bounds for Certain Multiprocessing Anomalies
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1445351 (Why is no real title available?)
- Improved Bounds for the Online Scheduling Problem
- New algorithms for an ancient scheduling problem.
- New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
- On randomized online scheduling
- On-line bin-stretching
- On-line scheduling revisited
- Semi on-line algorithms for the partition problem
- Semi-on-line multiprocessor scheduling with given total processing time
- Semi-on-line scheduling on two parallel processors with an upper bound on the items
- Semi-online scheduling on two uniform processors
- The on-line multiprocessor scheduling problem with known sum of the tasks
- The Power of Reordering for Online Minimum Makespan Scheduling
Cited in
(27)- A survey on makespan minimization in semi-online environments
- A two-phase algorithm for bin stretching with stretching factor 1.5
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- Online bin stretching with three bins
- 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
- Dynamic programming optimization in line of sight networks
- Rejecting jobs to minimize load and maximum flow-time
- An efficient algorithm for bin stretching
- Online bin packing with advice
- Semi-online scheduling: a survey
- Semi-online scheduling problems on a small number of machines
- Online bin stretching with bunch techniques
- Semi-online bipartite matching
- Bin stretching with migration on two hierarchical machines
- Graceful Degradation in Semi-Clairvoyant Scheduling
- Parallel solutions for preemptive makespan scheduling on two identical machines
- Dynamic scheduling of patients in emergency departments
- Online early work maximization on three hierarchical machines with a common due date
- Semi-online scheduling on two identical parallel machines with initial-lookahead information
- Online two-dimensional load balancing
- Fifty years of research in scheduling -- theory and applications
- Semi-online multiprocessor scheduling with known largest job processing time
- Improved online load balancing with known makespan
- Semi-online models for cardinality constrained bin packing
- Scheduling with testing on multiple identical parallel machines
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
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)
