Resource scheduling with variable requirements over time
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 432822 (Why is no real title available?)
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 871909 (Why is no real title available?)
- A Modified Split-Radix FFT With Fewer Arithmetic Operations
- A fast string searching algorithm
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Efficient 2-dimensional approximate matching of half-rectangular figures
- Fast Pattern Matching in Strings
- Generalized String Matching
- Non-standard stringology: algorithms and complexity
- On the complexity of coordinated display of multimedia objects
- Resource constrained scheduling as generalized bin packing
- Scheduling Parallel Machines On-Line
Cited in
(5)- Smooth scheduling under variable rates or the analog-digital confinement game
- Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption.
- A simple optimal algorithm for scheduling variable-sized requests
- Understanding the time dimension in resource management
- Resource allocation for covering time varying demands
This page was built for publication: Resource scheduling with variable requirements over time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835625)