Scheduling with semaphore constraints

DOI10.1016/0167-6377(87)90023-XzbMath0633.90033OpenAlexW2049477262MaRDI QIDQ1096534

Errol L. Lloyd

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90023-x

zbMATH Keywords

NP-completenesslinear time algorithmminimum length schedulingsemaphore constraintstask systems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Bounds on list scheduling of UET tasks with restricted resource constraints
• On the computational power of pushdown automata
• Concurrent Task Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling with semaphore constraints