Pages that link to "Item:Q5896927"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5896927):
Displaying 8 items.
- Makespan minimization with OR-precedence constraints (Q2059086) (← links)
- Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules (Q4642481) (← links)
- Scheduling with AND/OR Precedence Constraints (Q4651470) (← links)
- Forcing relations for AND/OR precedence constraints (Q4952622) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
- Coping with Incomplete Information in Scheduling — Stochastic and Online Models (Q5391870) (← links)
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (Q6166913) (← links)