Pages that link to "Item:Q983632"
From MaRDI portal
The following pages link to A decomposition scheme for single stage scheduling problems (Q983632):
Displaying 11 items.
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263) (← links)
- Decomposition in single-machine scheduling (Q1273128) (← links)
- Solution of the generalized Townsend single machine scheduling model (Q1278202) (← links)
- Analysis of the temporal decomposition procedure for scheduling with release and due dates (Q1303726) (← links)
- On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
- Dual decomposition of a single-machine scheduling problem (Q1906279) (← links)
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
- (Q3139225) (← links)
- Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine (Q4497861) (← links)
- Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm (Q5687644) (← links)
- Solution of a large-scale two-stage decision and scheduling problem using decomposition (Q5946534) (← links)
