Pages that link to "Item:Q5438669"
From MaRDI portal
The following pages link to Flow shop-sequencing problem with synchronous transfers and makespan minimization (Q5438669):
Displayed 7 items.
- The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
- Solution algorithms for synchronous flow shop problems with two dominating machines (Q342451) (← links)
- Synchronous flow shop scheduling with pliable jobs (Q723997) (← links)
- Complexity results for flow shop problems with synchronous movement (Q726218) (← links)
- Flow shop scheduling with flexible processing times (Q1621840) (← links)
- Open shop scheduling with synchronization (Q1702656) (← links)
- Decomposition algorithms for synchronous flow shop problems with additional resources and setup times (Q1751897) (← links)