An approximation algorithm for a parallel machine scheduling problem with constraints

zbMATH Open0994.90070MaRDI QIDQ2725273

Could not fetch data.

Publication date: 10 October 2002

Published in: Applied Mathematics. Series A (Chinese Edition) (Search for Journal in Brave)

zbMATH Keywords

worst-case analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (7)

Approximation schemes for parallel machine scheduling problems with controllable processing times ⋮ Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location ⋮ Improved bounds on relaxations of a parallel machine scheduling problem ⋮ An exact framework for the discrete parallel machine scheduling location problem ⋮ An approximation algorithm for identical parallel machine scheduling with resource dependent processing times ⋮ Fast approximation algorithms for uniform machine scheduling with processing set restrictions ⋮ Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

This page was built for publication: An approximation algorithm for a parallel machine scheduling problem with constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2725273)