Pages that link to "Item:Q4238532"
From MaRDI portal
The following pages link to Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds (Q4238532):
Displaying 31 items.
- Optimal restricted due date assignment in scheduling (Q322834) (← links)
- An improved monotone algorithm for scheduling related machines with precedence constraints (Q408428) (← links)
- A study of scheduling problems with preemptions on multi-core computers with GPU accelerators (Q499342) (← links)
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- Scheduling of uniform parallel machines with s-precedence constraints (Q646123) (← links)
- On the price of heterogeneity in parallel systems (Q733722) (← links)
- Scheduling algorithms for procrastinators (Q835586) (← links)
- Speed scaling of tasks with precedence constraints (Q927406) (← links)
- A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
- Power-aware scheduling for makespan and flow (Q1041350) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. (Q1401200) (← links)
- On-line scheduling with precedence constraints (Q1602711) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Makespan minimization with OR-precedence constraints (Q2059086) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
- Scheduling precedence-constrained jobs with stochastic processing times on parallel machines (Q2768404) (← links)
- Conditional hardness of precedence constrained scheduling on identical machines (Q2875202) (← links)
- Approximation Algorithms for Scheduling with Resource and Precedence Constraints (Q3304123) (← links)
- Towards Tight Lower Bounds for Scheduling Problems (Q3452775) (← links)
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints (Q3602833) (← links)
- The Loading Time Scheduling Problem (Q4500856) (← links)
- Min-Sum Scheduling Under Precedence Constraints (Q4606348) (← links)
- An improved approximation algorithm for scheduling under arborescence precedence constraints (Q5089259) (← links)
- Non-Clairvoyant Precedence Constrained Scheduling. (Q5091220) (← links)
- APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS (Q5187850) (← links)
- Parallel Processing and Applied Mathematics (Q5307342) (← links)
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems (Q5470732) (← links)
- Related machine scheduling with machine speeds satisfying linear constraints (Q5918518) (← links)
- Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints (Q6551087) (← links)
- Communication-aware scheduling of precedence-constrained tasks on related machines (Q6556208) (← links)
