Bounds for Multiprocessor Scheduling with Resource Constraints
From MaRDI portal
Cited in
(54)- New trends in machine scheduling
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- List scheduling bounds for UET systems with resources
- Resource constrained scheduling as generalized bin packing
- Bounds on list scheduling of UET tasks with restricted resource constraints
- On chromatic sums and distributed resource allocation
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- Fairness in parallel job scheduling
- Scheduling space-sharing for internet advertising
- On an on-line scheduling problem for parallel jobs
- Minimizing the makespan on two identical parallel machines with mold constraints
- Window-based greedy contention management for transactional memory: theory and practice
- Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints
- Malleable scheduling for flows of jobs and applications to MapReduce
- Scheduling with an orthogonal resource constraint
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Resource constrained scheduling on multiple machines
- New results in two identical machines scheduling with agreement graphs
- A competitive analysis for balanced transactional memory workloads
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
- Competitive online scheduling of perfectly malleable jobs with setup times
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
- Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints
- An improved algorithm for parallel machine scheduling under additional resource constraints
- Asynchronous coordination under preferences and constraints
- Parallel machine scheduling with a simultaneity constraint and unit-length jobs to minimize the makespan
- Linear time algorithms for multiple cluster scheduling and multiple strip packing
- Approximation algorithms for scheduling with resource and precedence constraints
- Scheduling malleable tasks with precedence constraints
- NP-Complete operations research problems and approximation algorithms
- Approximation scheduling algorithms: a survey
- An effective approximation algorithm for the malleable parallel task scheduling problem
- A family of scheduling algorithms for hybrid parallel platforms
- On-line bin packing ? A restricted survey
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints
- An efficient job scheduling algorithm in partitionable mesh connected systems
- scientific article; zbMATH DE number 7650084 (Why is no real title available?)
- On-line hierarchical job scheduling on grids with admissible allocation
- Malleable scheduling beyond identical machines
- An improved approximation algorithm for scheduling monotonic moldable tasks
- Greedy scheduling with custom-made objectives
- A log-linear (2 +5/6)-approximation algorithm for parallel machine scheduling with a single orthogonal resource
- Fifty years of research on resource-constrained project scheduling explored from different perspectives
- Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments
- Exact algorithms for energy-constrained scheduling on identical parallel machines
- Resource scheduling with variable requirements over time
- Scheduling with conflicts: Online and offline algorithms
- Scheduling parallel jobs to minimize the makespan
- Improved upper bounds for online malleable job scheduling
- Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines
This page was built for publication: Bounds for Multiprocessor Scheduling with Resource Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4099212)
