Semi-online scheduling on two identical machines with rejection
From MaRDI portal
Publication:385491
DOI10.1007/S10878-011-9435-XzbMATH Open1282.90075OpenAlexW2076850149MaRDI QIDQ385491FDOQ385491
Authors: Xiao Min, Yuqing Wang, Min Jiang, Jing Liu 
Publication date: 2 December 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9435-x
Recommendations
- Semi on-line scheduling on two identical machines with rejection
- Optimal semi-online algorithm for scheduling with rejection on two uniform machines
- Preemptive 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 for single machine scheduling with rejection
Cites Work
- Preemptive scheduling with rejection
- Multiprocessor Scheduling with Rejection
- Online scheduling with reassignment
- On-line uniform machine scheduling with rejection
- Approximation schemes for scheduling on uniformly related and identical parallel machines
- Optimal semi-online algorithm for scheduling with rejection on two uniform 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
Cited In (6)
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Preemptive semi-on-line scheduling on two identical machines with rejection
- Semi on-line scheduling on two identical machines with rejection
- Title not available (Why is that?)
- Online scheduling of unit jobs on three machines with rejection: a tight result
- Optimal semi-online algorithm for scheduling with rejection on two uniform machines
This page was built for publication: Semi-online scheduling on two identical machines with rejection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385491)
