Critical Path Scheduling of Task Systems with Resource and Processor Constraints
Several papers over the past few years have investigated minimum execution time scheduling of unit execution time (UET) task systems with resources. Because such scheduling problems are, in general, NP-hard, a variety of heuristic methods for producing schedules have been studied, among them, critic...
| מחבר ראשי: | |
|---|---|
| יצא לאור: |
2023
|
| גישה מקוונת: | https://hdl.handle.net/1721.1/148988 |