Pages that link to "Item:Q4632219"
From MaRDI portal
The following pages link to On Approximation Algorithms for Two-Stage Scheduling Problems (Q4632219):
Displaying 11 items.
- Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
- Competitive algorithms for multistage online scheduling (Q1753459) (← links)
- Approximation algorithms on multiple two-stage flowshops (Q1791041) (← links)
- On scheduling multiple two-stage flowshops (Q1985613) (← links)
- On scheduling inclined jobs on multiple two-stage flowshops (Q2319904) (← links)
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473) (← links)
- A data intensive heuristic approach to the two-stage streaming scheduling problem (Q2402350) (← links)
- Tighter Approximation Bounds for LPT Scheduling in Two Special Cases (Q3434556) (← links)
- (Q3682217) (← links)
- Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler (Q4490785) (← links)
- A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops (Q6546990) (← links)