Optimal semi-online algorithm for scheduling with rejection on two uniform machines
From MaRDI portal
Publication:411229
DOI10.1007/S10878-010-9316-8zbMATH Open1236.90055OpenAlexW2070722664MaRDI QIDQ411229FDOQ411229
Authors: Xiao Min, Yuqing Wang, Jing Liu 
Publication date: 4 April 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9316-8
Recommendations
- Semi on-line preemptive scheduling on two uniform machines with rejection
- Semi-online scheduling on two identical machines with rejection
- Semi on-line scheduling on two identical machines with rejection
- A special case of on-line scheduling on two uniformly machines with rejection
- A semi-online algorithm for single machine scheduling with rejection
Cites Work
- Preemptive scheduling with rejection
- Multiprocessor Scheduling with Rejection
- Randomized on-line scheduling on two uniform machines
- Semi on-line scheduling on two identical machines
- Semi on-line algorithms for the partition problem
- On-line uniform machine scheduling with rejection
- Approximation schemes for scheduling on uniformly related and identical parallel machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
- Semi on-line scheduling on two identical machines with rejection
Cited In (9)
- An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
- A semi-online algorithm for single machine scheduling with rejection
- Semi on-line scheduling on two identical machines with rejection
- Semi on-line preemptive scheduling on two uniform machines with rejection
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
- Online scheduling of unit jobs on three machines with rejection: a tight result
- Title not available (Why is that?)
- Semi-online scheduling: a survey
- Semi-online scheduling on two identical machines with rejection
This page was built for publication: Optimal semi-online algorithm for scheduling with rejection on two uniform machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411229)
