Linear time algorithms for parallel machine scheduling
From MaRDI portal
Publication:856829
DOI10.1007/S10114-005-0838-4zbMATH Open1151.90436OpenAlexW2045247244MaRDI QIDQ856829FDOQ856829
Publication date: 13 December 2006
Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-005-0838-4
Recommendations
Cites Work
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- An Application of Bin-Packing to Multiprocessor Scheduling
- Semi on-line scheduling on two identical machines
- Semi on-line algorithms for the partition problem
- Semi-on-line problems on two identical machines with combined partial information
- Semi-online scheduling with decreasing job sizes
- Title not available (Why is that?)
- A linear compound algorithm for uniform machine scheduling
- Preemptive semi-online algorithms for parallel machine scheduling with known total size
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
Cited In (6)
- Time optimal linear schedules for algorithms with uniform dependencies
- Title not available (Why is that?)
- Parallel machine scheduling, linear programming, and parameter list scheduling heuristics
- Algorithmic Applications in Management
- Approximation and Online Algorithms
- Title not available (Why is that?)
This page was built for publication: Linear time algorithms for parallel machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856829)