Pages that link to "Item:Q3304123"
From MaRDI portal
The following pages link to Approximation Algorithms for Scheduling with Resource and Precedence Constraints (Q3304123):
Displaying 16 items.
- Fast combination of scheduling chains under resource and time constraints (Q886400) (← links)
- A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
- Approximate solution of a resource-constrained scheduling problem (Q1009198) (← links)
- Resource cost aware scheduling (Q1750475) (← links)
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates (Q2294224) (← links)
- Scheduling of tasks with effectiveness precedence constraints (Q2300636) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- Algorithms for Scheduling Imprecise Computations with Timing Constraints (Q3358218) (← links)
- Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
- (Q4737537) (← links)
- Quasi-PTAS for scheduling with precedences using LP hierarchies (Q5002735) (← links)
- Parallel Processing and Applied Mathematics (Q5307342) (← links)
- (Q5456411) (← links)
- (Q5874275) (← links)
- A unified approach to approximating resource allocation and scheduling (Q5895231) (← links)
- Approximation algorithms for scheduling with reservations (Q5961975) (← links)