Pages that link to "Item:Q508765"
From MaRDI portal
The following pages link to Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling (Q508765):
Displaying 13 items.
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem (Q337004) (← links)
- Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises (Q492824) (← links)
- A flexible job shop scheduling approach with operators for coal export terminals (Q1725593) (← links)
- A multi-objective hot-rolling scheduling problem in the compact strip production (Q1984951) (← links)
- A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem (Q1992548) (← links)
- An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria (Q2003434) (← links)
- A priority-based genetic algorithm for a flexible job shop scheduling problem (Q2358304) (← links)
- A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times (Q2668713) (← links)
- A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem (Q2669753) (← links)
- Approximate dominance NSGA-III algorithm for solving flexible job-shop scheduling problem (Q3381565) (← links)
- Harmony search algorithm based on RUD for sloving job-shop scheduling problem (Q4575004) (← links)
- Differential evolution algorithm with dynamic multi-population applied to flexible job shop schedule (Q6048122) (← links)
- Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem (Q6092613) (← links)
