Scheduling with an orthogonal resource constraint
From MaRDI portal
Publication:2350899
Recommendations
- Scheduling with an orthogonal resource constraint
- A log-linear \((2 +5/6)\)-approximation algorithm for parallel machine scheduling with a single orthogonal resource
- Resource constrained scheduling on multiple machines
- Multiprocessor scheduling with machine allotment and parallelism constraints
- Tight approximations for resource constrained scheduling and bin packing
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2086932 (Why is no real title available?)
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Algorithms for Scheduling Independent Tasks
- Bin packing can be solved within 1+epsilon in linear time
- Bounds for Certain Multiprocessing Anomalies
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Bounds on Multiprocessing Timing Anomalies
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Machine scheduling with resource dependent processing times
- Scheduling subject to resource constraints: Classification and complexity
Cited in
(6)- Minimizing the makespan on two identical parallel machines with mold constraints
- Joint cache partition and job assignment on multi-core processors
- Improved scheduling with a shared resource
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Scheduling with an orthogonal resource constraint
- A log-linear \((2 +5/6)\)-approximation algorithm for parallel machine scheduling with a single orthogonal resource
This page was built for publication: Scheduling with an orthogonal resource constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350899)