Pages that link to "Item:Q2489279"
From MaRDI portal
The following pages link to A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (Q2489279):
Displayed 5 items.
- Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106) (← links)
- Approximation results for flow shop scheduling problems with machine availability constraints (Q954036) (← links)
- Flow shops with machine maintenance: ordered and proportionate cases (Q992582) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← links)