Critical Path Scheduling with Resource and Processor Constraints

DOI10.1145/322326.322336zbMath0494.68039OpenAlexW2065737997MaRDI QIDQ3957934

Errol L. Lloyd

Publication date: 1982

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322326.322336

zbMATH Keywords

worst-case performanceprecedence constraintsapproximation algorithmsbin packingresource constraintsidentical processorstask system with resources

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile ⋮ A mathematical model of a concurrent vehicle development system: estimating lead time

This page was built for publication: Critical Path Scheduling with Resource and Processor Constraints