On-line bin-stretching
From MaRDI portal
Publication:5958712
DOI10.1016/S0304-3975(00)00258-9zbMath0984.68195MaRDI QIDQ5958712
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (39)
Online-bounded analysis ⋮ A survey on makespan minimization in semi-online environments ⋮ Online makespan minimization with parallel schedules ⋮ Scheduling with testing on multiple identical parallel machines ⋮ Tight upper bounds for semi-online scheduling on two uniform machines with known optimum ⋮ Semi-online machine covering on two uniform machines with known total size ⋮ Improved lower bounds for the online bin stretching problem ⋮ Optimal semi-online algorithms for machine covering ⋮ Semi-online scheduling: a survey ⋮ Semi-online scheduling problems on two identical machines with inexact partial information ⋮ A two-phase algorithm for bin stretching with stretching factor 1.5 ⋮ Semi-online scheduling problems on a small number of machines ⋮ Bin stretching with migration on two hierarchical machines ⋮ Parallel solutions for preemptive makespan scheduling on two identical machines ⋮ Online early work maximization on three hierarchical machines with a common due date ⋮ An efficient algorithm for semi-online multiprocessor scheduling with given total processing time ⋮ Online bin stretching with three bins ⋮ Semi-online scheduling revisited ⋮ An efficient algorithm for bin stretching ⋮ Online scheduling with reassignment ⋮ ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES ⋮ Semi-online scheduling with ``end of sequence information ⋮ Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling ⋮ Online bin stretching with bunch techniques ⋮ Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information ⋮ List scheduling for jobs with arbitrary release times and similar lengths ⋮ Online Bounded Analysis ⋮ Machine covering with combined partial information ⋮ Semi-on-line multiprocessor scheduling with given total processing time ⋮ Optimal semi-online preemptive algorithms for machine covering on two uniform machines ⋮ Online scheduling with a buffer on related machines ⋮ Several semi-online scheduling problems on two identical machines with combined information ⋮ Two semi-online scheduling problems on two uniform machines ⋮ An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time ⋮ Online Order Scheduling Problem with the Same Order Size on Two Identical Machines ⋮ Tight lower bounds for semi-online scheduling on two uniform machines with known optimum ⋮ Semi-online scheduling jobs with tightly-grouped processing times on three identical machines ⋮ Discovering and certifying lower bounds for the online bin stretching problem ⋮ Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
Cites Work
- New algorithms for an ancient scheduling problem.
- Semi on-line algorithms for the partition problem
- A lower bound for randomized on-line scheduling algorithms
- New lower and upper bounds for on-line scheduling
- On-Line Load Balancing of Temporary Tasks
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- On-Line Load Balancing of Temporary Tasks on Identical Machines
- On-line load balancing with applications to machine scheduling and virtual circuit routing
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On-line bin-stretching
