Pages that link to "Item:Q726218"
From MaRDI portal
The following pages link to Complexity results for flow shop problems with synchronous movement (Q726218):
Displaying 10 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)
- 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)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Analysis of flow shop scheduling anomalies (Q2272295) (← links)
- The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
- Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines (Q2305020) (← links)