Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
DOI10.1007/BF01415940zbMath0693.90057OpenAlexW2035609757MaRDI QIDQ3468873
No author found.
Publication date: 1989
Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01415940
tree-like precedence constraintsschedules for treestwo processor schedulingworst-case absolute error
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Deterministic scheduling theory in operations research (90B35)
Related Items (2)
Cites Work
- Unnamed Item
- Scheduling subject to resource constraints: Classification and complexity
- NP-complete scheduling problems
- Optimal scheduling for two-processor systems
- Scheduling precedence graphs of bounded height
- Profile Scheduling of Opposing Forests and Level Orders
- An Almost-Linear Algorithm for Two-Processor Scheduling
- Computer-Aided complexity classification of combinational problems
- Scheduling Opposing Forests
- The NP-completeness column: An ongoing guide
This page was built for publication: Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints