Pages that link to "Item:Q1992548"
From MaRDI portal
The following pages link to A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem (Q1992548):
Displaying 10 items.
- A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem (Q1652147) (← links)
- An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria (Q2003434) (← links)
- A multi-objective memetic algorithm for the job-shop scheduling problem (Q2359531) (← links)
- A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times (Q2668713) (← links)
- Bi-objective no-wait multiproduct multistage product scheduling problem with flexible due dates based on MOIDE-MA (Q2669640) (← 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)
- Multi-objective fuzzy flexible job shop scheduling using memetic algorithm (Q5106976) (← links)
- An improved MOEA/D for multi-objective flexible job shop scheduling by considering efficiency and cost (Q6568497) (← links)
- Flexible job-shop scheduling with limited flexible workers using an improved multiobjective discrete teaching-learning based optimization algorithm (Q6640152) (← links)
