A comment on scheduling two parallel machines with capacity constraints

DOI10.1016/j.disopt.2005.06.005zbMath1131.90024MaRDI QIDQ2581321

Gerhard J. Woeginger

Publication date: 9 January 2006

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2005.06.005

zbMATH Keywords

approximation algorithm; parallel machine scheduling; approximation scheme

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68W25: Approximation algorithms

Related Items

Approximating Scheduling Machines with Capacity Constraints, Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date, Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval, Approximation algorithms for single machine scheduling with one unavailability period, Simple matching vs linear assignment in scheduling models with positional effects: a critical review, An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints

Cites Work

• An approximation algorithm for scheduling two parallel machines with capacity constraints.
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?