A new approximation algorithm for UET-scheduling with chain-type precedence constraints.

DOI10.1016/S0305-0548(98)00022-7zbMath1042.90563OpenAlexW2002235837WikidataQ128116592 ScholiaQ128116592MaRDI QIDQ1406686

Jianjun Wen, Guo-Chuan Zhang, Ji-ye Han

Publication date: 7 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00022-7

zbMATH Keywords

parallel machinesapproximation algorithmmakespanPrecedence constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (1)

On scheduling cycle shops: Classification, complexity and approximation

Cites Work

• Unnamed Item
• On a scheduling problem where a job can be executed only by a limited number of processors
• UET-scheduling with constrained processor allocations
• UET-scheduling with chain-type precedence constraints
• Scheduling with constrained processor allocation for interval orders
• Bounds on the Scheduling of Typed Task Systems
• Flowshop and Jobshop Schedules: Complexity and Approximation

This page was built for publication: A new approximation algorithm for UET-scheduling with chain-type precedence constraints.