Pages that link to "Item:Q4497882"
From MaRDI portal
The following pages link to An Exact Method for Solving the Multi-Processor Flow-Shop (Q4497882):
Displayed 11 items.
- Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
- Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis (Q817121) (← links)
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search (Q846170) (← links)
- Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
- A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
- List scheduling in a parallel machine environment with precedence constraints and setup times (Q1604056) (← links)
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
- Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
- The hybrid flow shop scheduling problem (Q2270289) (← links)
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)