UET-scheduling with chain-type precedence constraints

DOI10.1016/0305-0548(94)00084-LzbMath0854.90078OpenAlexW2098687870MaRDI QIDQ1919973

Klaus Jansen, Zhongliang Yu, Gerhard J. Woeginger

Publication date: 1995

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

Full work available at URL: https://doi.org/10.1016/0305-0548(94)00084-l

zbMATH Keywords

parallel machinesprecedence constrained schedulingconstant worst case guarantee

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

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

Cites Work

• On a scheduling problem where a job can be executed only by a limited number of processors
• UET-scheduling with constrained processor allocations
• Scheduling with constrained processor allocation for interval orders
• Nearly on-line scheduling of multiprocessor systems with memories
• Optimal Sequencing of Two Equivalent Processors
• Unnamed Item
• Unnamed Item

This page was built for publication: UET-scheduling with chain-type precedence constraints