Bounds for Multiprocessor Scheduling with Resource Constraints

DOI10.1137/0204015zbMATH Open0333.68041DBLPjournals/siamcomp/GareyG75OpenAlexW2154305205WikidataQ92414881 ScholiaQ92414881MaRDI QIDQ4099212FDOQ4099212

Cited In (52)

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

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)