Pages that link to "Item:Q878557"
From MaRDI portal
The following pages link to An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint (Q878557):
Displaying 14 items.
- The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- A PTAS for a particular case of the two-machine flow shop with limited machine availability (Q483257) (← 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 improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs (Q972619) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- Approximability of two-machine no-wait flowshop scheduling with availability constraints. (Q1413925) (← links)
- An improved heuristic for two-machine flowshop scheduling with an availability constraint (Q1591549) (← links)
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (Q1640598) (← links)
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (Q2489279) (← links)
- Modeling and solving the flow-shop scheduling problem with sequence-dependent setup times by firefly algorithm (case study: automotive industry) (Q2676023) (← links)
- Batch-size-based rearrangement of the shop floor into mini-lines (Q2967580) (← links)
- A two-stage flow shop scheduling with a critical machine and batch availability (Q2978425) (← links)
