Pages that link to "Item:Q913500"
From MaRDI portal
The following pages link to Preemptive scheduling of interval orders is polynomial (Q913500):
Displaying 9 items.
- Preemptive scheduling and antichain polyhedra (Q1003473) (← links)
- A polynomial algorithm for recognizing the \(\mathcal A\)-order class (Q1043599) (← links)
- Rational preemptive scheduling (Q1105366) (← links)
- A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays (Q1306465) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Review of properties of different precedence graphs for scheduling problems (Q1847252) (← links)
- Optimal preemptive scheduling on a fixed number of identical parallel machines (Q2488216) (← links)
- Non-preemptive profile scheduling and quasi-interval orders (Q2741353) (← links)
- Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results (Q3598041) (← links)