Pages that link to "Item:Q2230732"
From MaRDI portal
The following pages link to A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements (Q2230732):
Displaying 3 items.
- On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements (Q2149603) (← links)
- Two-machine flow shops with an optimal permutation schedule under a storage constraint (Q2197318) (← links)
- Maximizing total early work in a distributed two‐machine flow‐shop (Q6078603) (← links)