Pages that link to "Item:Q4099212"
From MaRDI portal
The following pages link to Bounds for Multiprocessor Scheduling with Resource Constraints (Q4099212):
Displaying 50 items.
- Scheduling malleable tasks with precedence constraints (Q414874) (← links)
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- On-line hierarchical job scheduling on grids with admissible allocation (Q600844) (← links)
- Greedy scheduling with custom-made objectives (Q613772) (← links)
- Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments (Q712676) (← links)
- Resource scheduling with variable requirements over time (Q835625) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- Improved upper bounds for online malleable job scheduling (Q892840) (← links)
- Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines (Q917426) (← links)
- New trends in machine scheduling (Q1107428) (← links)
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
- List scheduling bounds for UET systems with resources (Q1139371) (← links)
- Resource constrained scheduling as generalized bin packing (Q1249132) (← links)
- Bounds on list scheduling of UET tasks with restricted resource constraints (Q1259426) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Fairness in parallel job scheduling (Q1588058) (← links)
- Scheduling space-sharing for internet advertising (Q1600000) (← links)
- On an on-line scheduling problem for parallel jobs (Q1603586) (← links)
- Minimizing the makespan on two identical parallel machines with mold constraints (Q1722974) (← links)
- Window-based greedy contention management for transactional memory: theory and practice (Q1938368) (← links)
- Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers (Q2026982) (← links)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2149860) (← links)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
- Scheduling with an orthogonal resource constraint (Q2350899) (← links)
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods (Q2356015) (← links)
- Resource constrained scheduling on multiple machines (Q2390306) (← links)
- New results in two identical machines scheduling with agreement graphs (Q2420580) (← links)
- A competitive analysis for balanced transactional memory workloads (Q2429336) (← links)
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
- Competitive online scheduling of perfectly malleable jobs with setup times (Q2467259) (← links)
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks (Q2503351) (← links)
- Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times (Q2669803) (← links)
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2680859) (← links)
- An improved algorithm for parallel machine scheduling under additional resource constraints (Q2693796) (← links)
- Asynchronous Coordination Under Preferences and Constraints (Q2835020) (← links)
- PARALLEL MACHINE SCHEDULING WITH A SIMULTANEITY CONSTRAINT AND UNIT-LENGTH JOBS TO MINIMIZE THE MAKESPAN (Q3074794) (← links)
- Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing (Q3297564) (← links)
- Approximation Algorithms for Scheduling with Resource and Precedence Constraints (Q3304123) (← links)
- NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)
- A Family of Scheduling Algorithms for Hybrid Parallel Platforms (Q4639930) (← links)
- On-line bin packing ? A restricted survey (Q4845093) (← links)
- Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times (Q4972675) (← links)
- Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)
- AN EFFICIENT JOB SCHEDULING ALGORITHM IN PARTITIONABLE MESH CONNECTED SYSTEMS (Q5249289) (← links)
- (Q5875469) (← links)
- Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← links)
