Pages that link to "Item:Q2149603"
From MaRDI portal
The following pages link to On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements (Q2149603):
Displaying 4 items.
- Special issue: 18th international conference on mathematical optimization theory and operations research (MOTOR 2019) (Q2149598) (← links)
- A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements (Q2230732) (← links)
- An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements (Q6497031) (← links)
- Algorithms for flow shop with job-dependent buffer requirements (Q6629020) (← links)