Pages that link to "Item:Q1401639"
From MaRDI portal
The following pages link to Competitive genetic algorithms for the open-shop scheduling problem (Q1401639):
Displaying 24 items.
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
- A contribution and new heuristics for open shop scheduling (Q733548) (← links)
- The museum visitor routing problem (Q969135) (← links)
- Order acceptance using genetic algorithms (Q1000954) (← links)
- A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
- Local search with constraint propagation and conflict-based heuristics (Q1606115) (← links)
- An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
- Retraction note to: ``OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises'' (Q1730695) (← links)
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling (Q1764767) (← links)
- A simple and effective evolutionary algorithm for the vehicle routing problem (Q1879785) (← links)
- Dynamic programming approach for solving the open shop problem (Q2033324) (← 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)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- A genetic algorithm for scheduling open shops with sequence-dependent setup times (Q2333145) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
- A new particle swarm optimization for the open shop scheduling problem (Q2482375) (← links)
- An optimal constraint programming approach to the open-shop problem (Q2815442) (← links)
- A new particle swarm optimization for multi-objective open shop scheduling (Q2903242) (← links)
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
- Solving the open shop scheduling problem (Q5939272) (← links)
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← links)
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)
