The following pages link to (Q4737537):
Displaying 11 items.
- Linear programming based algorithms for preemptive and non-preemptive RCPSP (Q884023) (← links)
- Preemptive scheduling of interval orders is polynomial (Q913500) (← links)
- A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays (Q1306465) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources (Q1698276) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (Q1885337) (← links)
- Scheduling with an orthogonal resource constraint (Q2350899) (← links)
- An approximation algorithm for the general max-min resource sharing problem (Q2492678) (← links)
- Bounding the Power of Preemption in Randomized Scheduling (Q4210081) (← links)
- The preemptive resource allocation problem (Q6547132) (← links)
