Grouping techniques for scheduling problems: simpler and faster
From MaRDI portal
Publication:930594
DOI10.1007/s00453-007-9086-6zbMath1159.90403MaRDI QIDQ930594
Monaldo Mastrolilli, Klaus Jansen, Aleksei V. Fishkin
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
90B35: Deterministic scheduling theory in operations research
Related Items
TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION, A PTAS for Scheduling Unrelated Machines of Few Different Types, Moderately exponential approximation for makespan minimization on related machines, Improved approximation algorithms for parallel machine scheduling with release dates and job rejection, Scheduling parallel machines with inclusive processing set restrictions and job release times, Approximation Schemes for Robust Makespan Scheduling Problems
Cites Work
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Approximability of flow shop scheduling
- Makespan minimization in open shops: A polynomial time approximation scheme
- An approximation algorithm for the generalized assignment problem
- On some geometric methods in scheduling theory: A survey
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Better Approximation Guarantees for Job-Shop Scheduling
- A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Improved Approximation Algorithms for Shop Scheduling Problems
- Short Shop Schedules
- Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
- Polynomial time approximation schemes for general multiprocessor job shop scheduling
- Coordination Complexity of Parallel Price-Directive Decomposition
- A linear time approximation scheme for the single machine scheduling problem with controllable processing times
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- Scheduling independent multiprocessor tasks
