Pages that link to "Item:Q2390265"
From MaRDI portal
The following pages link to An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint (Q2390265):
Displayed 13 items.
- The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis (Q483213) (← links)
- An improved algorithm for the two machine flow shop problem with several availability constraints (Q607877) (← links)
- A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (Q691393) (← links)
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (Q732786) (← links)
- Heuristics for two-machine flowshop scheduling with setup times and an availability constraint (Q850314) (← links)
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint (Q878557) (← links)
- Approximation results for flow shop scheduling problems with machine availability constraints (Q954036) (← links)
- An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs (Q972619) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← 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 polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (Q2489279) (← links)
- Optimality of Jackson's permutations with respect to limited machine availability (Q5488246) (← links)