Pages that link to "Item:Q2482764"
From MaRDI portal
The following pages link to Heuristic constructive algorithms for open shop scheduling to minimize mean flow time (Q2482764):
Displaying 11 items.
- Aggregation heuristic for the open-pit block scheduling problem (Q321137) (← links)
- Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
- A contribution and new heuristics for open shop scheduling (Q733548) (← links)
- A new heuristic for open shop total completion time problem (Q967860) (← links)
- Classical and new heuristics for the open-shop problem: A computational evaluation (Q1296088) (← links)
- Constructive heuristic algorithms for the open shop problem (Q1310611) (← links)
- Open shop cyclic scheduling (Q1750495) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem (Q5168014) (← links)
