Pages that link to "Item:Q5915911"
From MaRDI portal
The following pages link to Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements (Q5915911):
Displaying 5 items.
- The scheduling problem where multiple machines compete for a common local buffer (Q1127173) (← links)
- Scheduling batch processing in flexible flowshop with job dependent buffer requirements: Lagrangian relaxation approach (Q1641106) (← links)
- On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements (Q2149603) (← links)
- A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements (Q2230732) (← links)
- Algorithms for flow shop with job-dependent buffer requirements (Q6629020) (← links)