Online scheduling with rearrangement on two related machines
From MaRDI portal
Publication:627161
DOI10.1016/J.TCS.2010.10.019zbMATH Open1206.68064OpenAlexW2032691644MaRDI QIDQ627161FDOQ627161
Authors: György Dósa, Xin Han, He Guo, Yuxin Wang 
Publication date: 21 February 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.019
Recommendations
- Optimal algorithms for online scheduling with bounded rearrangement at the end
- Online scheduling with one rearrangement at the end: revisited
- Semi-online hierarchical scheduling problems with buffer or rearrangements
- Online scheduling with a buffer on related machines
- Online scheduling with reassignment on two uniform machines
Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- On-line scheduling revisited
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Preemptive Online Scheduling with Reordering
- `` Strong NP-Completeness Results
- New algorithms for an ancient scheduling problem.
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- Online scheduling with reassignment
- Semi on-line algorithms for the partition problem
- Online scheduling on two uniform machines to minimize the makespan
- Better Bounds for Online Scheduling
- Improved Bounds for the Online Scheduling Problem
- The Power of Reordering for Online Minimum Makespan Scheduling
- A Better Algorithm for an Ancient Scheduling Problem
- Online scheduling with bounded migration
- Online scheduling with a buffer on related machines
- Online scheduling with reassignment on two uniform machines
Cited In (15)
- Online interval scheduling on two related machines: the power of lookahead
- Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
- Online Order Scheduling Problem with the Same Order Size on Two Identical Machines
- A survey on makespan minimization in semi-online environments
- General parametric scheme for the online uniform machine scheduling problem with two different speeds
- Online Makespan Scheduling with Job Migration on Uniform Machines
- Semi-online scheduling on two uniform parallel machines with initial lookahead
- Semi-online hierarchical scheduling problems with buffer or rearrangements
- Online minimum makespan scheduling with a buffer
- Title not available (Why is that?)
- Online scheduling with one rearrangement at the end: revisited
- Optimal algorithms for online scheduling with bounded rearrangement at the end
- Online makespan scheduling with job migration on uniform machines
- Semi-online scheduling: a survey
- Online scheduling with rejection and withdrawal
This page was built for publication: Online scheduling with rearrangement on two related machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627161)
