Pages that link to "Item:Q545969"
From MaRDI portal
The following pages link to Bounding strategies for the hybrid flow shop scheduling problem (Q545969):
Displaying 11 items.
- Machine scheduling in underground mining: an application in the potash industry (Q280169) (← links)
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
- Branch and bound crossed with GA to solve hybrid flowshops (Q1296101) (← links)
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
- A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations (Q1991311) (← links)
- The hybrid flow shop scheduling problem (Q2270289) (← links)
- Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
- Multiple-machine lower bounds for shop-scheduling problems (Q2884494) (← links)
- Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks (Q3003281) (← links)
- Aggregate planning in hybrid flowshops (Q4245661) (← links)
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds (Q5232862) (← links)