Pages that link to "Item:Q2414462"
From MaRDI portal
The following pages link to Flexible flow shop with dedicated buffers (Q2414462):
Displaying 5 items.
- On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements (Q2149603) (← links)
- On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine (Q2158014) (← links)
- A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs (Q2637353) (← links)
- Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements (Q5915911) (← links)
- Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach (Q6106764) (← links)