Pages that link to "Item:Q2389828"
From MaRDI portal
The following pages link to Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828):
Displaying 11 items.
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
- Scheduling open shops with parallel machines to minimize total completion time (Q609214) (← links)
- A contribution and new heuristics for open shop scheduling (Q733548) (← links)
- A multi-level genetic algorithm for a multi-stage space allocation problem (Q984123) (← links)
- Competitive genetic algorithms for the open-shop scheduling problem (Q1401639) (← links)
- Solving permutation flow shop scheduling problem with sequence-independent setup time (Q2176034) (← links)
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
- Multi-objective open shop scheduling by considering human error and preventive maintenance (Q2307240) (← links)
- The representation of partially-concurrent open shop problems (Q2398435) (← links)
- Heuristic constructive algorithms for open shop scheduling to minimize mean flow time (Q2482764) (← links)
