Semi-online scheduling with ``end of sequence information
From MaRDI portal
Publication:2460107
DOI10.1007/S10878-006-9040-6zbMath1180.90118OpenAlexW2069274628MaRDI QIDQ2460107
Publication date: 14 November 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9040-6
Related Items (8)
A survey on makespan minimization in semi-online environments ⋮ Semi-online scheduling with bounded job sizes on two uniform machines ⋮ Semi-online scheduling: a survey ⋮ Semi-online scheduling with known maximum job size on two uniform machines ⋮ Semi-online scheduling on two uniform machines with the known largest size ⋮ A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size ⋮ Semi-online preemptive scheduling: one algorithm for all variants ⋮ Online scheduling with a buffer on related machines
Cites Work
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- Online algorithms. The state of the art
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- Bin stretching revisited
- Semi-on-line problems on two identical machines with combined partial information
- Semi-online algorithms for parallel machine scheduling problems
- A note on on-line scheduling with partial information
- The on-line multiprocessor scheduling problem with known sum of the tasks
- Tight bounds for bandwidth allocation on two links
- Automata, Languages and Programming
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Optimal non-preemptive semi-online scheduling on two related machines
- Semi-online scheduling with decreasing job sizes
- Randomized on-line scheduling on two uniform machines
- On-line bin-stretching
This page was built for publication: Semi-online scheduling with ``end of sequence information
