Restricted assignment scheduling with resource constraints
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3902654 (Why is no real title available?)
- scientific article; zbMATH DE number 4095196 (Why is no real title available?)
- A quasi-polynomial approximation for the restricted assignment problem
- A simple algorithm for edge-coloring bipartite multigraphs
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Deadline scheduling of tasks with ready times and resource constraints
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Graph balancing: a special case of scheduling unrelated parallel machines
- Improved Algorithms for Bipartite Network Flow
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Minimizing mean flow time with parallel processors and resource constraints
- Multiprofessor scheduling
- Mutual exclusion scheduling
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- On \((1,\varepsilon)\)-restricted assignment makespan minimization
- Optimization, approximation, and complexity classes
- Packing triangles in bounded degree graphs.
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- Parallel machine scheduling with nested job assignment restrictions
- Paths, Trees, and Flowers
- Scheduling parallel dedicated machines under a single non-shared resource
- Scheduling parallel dedicated machines with the speeding-up resource
- Scheduling problems for parallel dedicated machines under multiple resource constraints.
- Scheduling subject to resource constraints: Classification and complexity
- Scheduling tasks on two processors with deadlines and additional resources
- Scheduling with conflicts: Online and offline algorithms
- Scheduling. Theory, algorithms, and systems
Cited in
(5)- On some special cases of the restricted assignment problem
- Resource constrained scheduling on multiple machines
- An improved algorithm for parallel machine scheduling under additional resource constraints
- Resource constrained assignment problems
- Parallel machine scheduling with job assignment restrictions
This page was built for publication: Restricted assignment scheduling with resource constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713408)
