An approximation algorithm for a parallel machine scheduling problem with constraints

MaRDI QIDQ2725273zbMATH OpenFDO

Authors Yong He

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)

Cited in

(7)

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

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)