Online scheduling with reassignment
From MaRDI portal
Publication:935241
DOI10.1016/J.ORL.2007.06.004zbMath1144.90400OpenAlexW2047811491MaRDI QIDQ935241
Publication date: 6 August 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2007.06.004
Related Items (16)
A survey on makespan minimization in semi-online environments ⋮ ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER ⋮ On the value of job migration in online makespan minimization ⋮ Semi-online scheduling on two identical machines with rejection ⋮ Semi-online scheduling: a survey ⋮ Online scheduling with rearrangement on two related machines ⋮ Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Online NDP-constraint scheduling of jobs with delivery times or weights ⋮ Online scheduling with one rearrangement at the end: revisited ⋮ Online scheduling with rejection and withdrawal ⋮ Optimal algorithms for online scheduling with bounded rearrangement at the end ⋮ Online Makespan Scheduling with Job Migration on Uniform Machines ⋮ Online scheduling with reassignment on two uniform machines ⋮ Online scheduling on two uniform machines to minimize the makespan ⋮ Online makespan scheduling with job migration on uniform machines
Cites Work
- Unnamed Item
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- On-line scheduling revisited
- On randomized online scheduling
- Improved Bounds for the Online Scheduling Problem
- Automata, Languages and Programming
- Bounds for Certain Multiprocessing Anomalies
- Semi-online scheduling with decreasing job sizes
- On-line bin-stretching
This page was built for publication: Online scheduling with reassignment
