Precedence constrained scheduling: A case in \({\mathbf P}\)

DOI10.1093/COMJNL/44.3.163zbMATH Open0984.68017OpenAlexW2057789083MaRDI QIDQ2746270

Panagiotis Tsanakas, Kostas Politopoulos, George F. Georgakopoulos

Publication date: 5 May 2002

Published in: The Computer Journal. Section A Section B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/44.3.163

zbMATH Keywords

constrained schedulingunit execution time

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Normal-form preemption sequences for an open problem in scheduling theory ⋮ Title not available (Why is that?) ⋮ A monotone approximation algorithm for scheduling with precedence constraints ⋮ Quasi-PTAS for scheduling with precedences using LP hierarchies ⋮ Title not available (Why is that?) ⋮ Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width

This page was built for publication: Precedence constrained scheduling: A case in \({\mathbf P}\)

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