Grouping techniques for scheduling problems: simpler and faster

DOI10.1007/S00453-007-9086-6MaRDI QIDQ930594zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A linear time approximation scheme for the single machine scheduling problem with controllable processing times
• A polynomial time approximation scheme for general multiprocessor job scheduling
• A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
• An approximation algorithm for the generalized assignment problem
• Approximability of flow shop scheduling
• Approximation algorithms for scheduling unrelated parallel machines
• Better approximation guarantees for job-shop scheduling
• Coordination Complexity of Parallel Price-Directive Decomposition
• Efficient approximation schemes for scheduling problems with release dates and delivery times
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Improved Approximation Algorithms for Shop Scheduling Problems
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
• Linear-Time approximation schemes for scheduling malleable parallel tasks
• Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
• Makespan minimization in open shops: A polynomial time approximation scheme
• On some geometric methods in scheduling theory: A survey
• Polynomial time approximation schemes for general multiprocessor job shop scheduling
• Scheduling independent multiprocessor tasks
• Short Shop Schedules

Cited in

(12)

• Improving the solution complexity of the scheduling problem with deadlines: a general technique
• A PTAS for scheduling unrelated machines of few different types
• Moderately exponential approximation for makespan minimization on related machines
• Approximation schemes for robust makespan scheduling problems
• A group priority earliest deadline first scheduling algorithm
• Two approximation schemes for scheduling on parallel machines under a grade of service provision
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
• Group-based Pfair scheduling
• Scheduling parallel machines with inclusive processing set restrictions and job release times
• A reduction technique for weighted grouping problems
• scientific article; zbMATH DE number 1877047 (Why is no real title available?)
• scientific article; zbMATH DE number 6007914 (Why is no real title available?)

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)