Approximation algorithm for job scheduling with reconfigurable resources
From MaRDI portal
Cites work
- A polynomial algorithm for multiprocessor scheduling with two job lengths.
- An Application of Bin-Packing to Multiprocessor Scheduling
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
- Assembly line balancing: what happened in the last fifteen years?
- Bounds on Multiprocessing Timing Anomalies
- Multi-mode resource constrained multi-project scheduling and resource portfolio problem
- Scheduling and fixed-parameter tractability
This page was built for publication: Approximation algorithm for job scheduling with reconfigurable resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030717)