Pages that link to "Item:Q1762134"
From MaRDI portal
The following pages link to A self-guided genetic algorithm for permutation flowshop scheduling problems (Q1762134):
Displaying 8 items.
- Total completion time with makespan constraint in no-wait flowshops with setup times (Q296867) (← links)
- A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
- Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems (Q727261) (← links)
- Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem (Q1666220) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem (Q2079447) (← links)
- Matching and scheduling of student-company-talks for a university it-speed dating event (Q2167666) (← links)
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem (Q2664317) (← links)