Grouping techniques for scheduling problems: simpler and faster
From MaRDI portal
Publication:930594
DOI10.1007/S00453-007-9086-6zbMATH Open1159.90403OpenAlexW2000619341MaRDI QIDQ930594FDOQ930594
Authors: Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli 
Publication date: 1 July 2008
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9086-6
Recommendations
- scientific article; zbMATH DE number 1877047
- Improved approximation schemes for scheduling unrelated parallel machines
- scientific article; zbMATH DE number 1560345
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- Approximation algorithms for scheduling unrelated parallel machines
Cites Work
- Title not available (Why is that?)
- An approximation algorithm for the generalized assignment problem
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Approximation algorithms for scheduling unrelated parallel machines
- Short Shop Schedules
- Makespan minimization in open shops: A polynomial time approximation scheme
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Approximability of flow shop scheduling
- Improved Approximation Algorithms for Shop Scheduling Problems
- Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
- Scheduling independent multiprocessor tasks
- A polynomial time approximation scheme for general multiprocessor job scheduling
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- On some geometric methods in scheduling theory: A survey
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Coordination Complexity of Parallel Price-Directive Decomposition
- Better approximation guarantees for job-shop scheduling
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- Polynomial time approximation schemes for general multiprocessor job shop scheduling
- A linear time approximation scheme for the single machine scheduling problem with controllable processing times
Cited In (12)
- Moderately exponential approximation for makespan minimization on related machines
- Title not available (Why is that?)
- Two approximation schemes for scheduling on parallel machines under a grade of service provision
- Group-based Pfair scheduling
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Approximation schemes for robust makespan scheduling problems
- A PTAS for Scheduling Unrelated Machines of Few Different Types
- A group priority earliest deadline first scheduling algorithm
- A reduction technique for weighted grouping problems
- Title not available (Why is that?)
- Improving the solution complexity of the scheduling problem with deadlines: a general technique
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
This page was built for publication: Grouping techniques for scheduling problems: simpler and faster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930594)
