Pages that link to "Item:Q2003434"
From MaRDI portal
The following pages link to An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria (Q2003434):
Displaying 10 items.
- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems (Q1954823) (← links)
- Integrating preferences within multiobjective flexible job shop scheduling (Q2103005) (← links)
- Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940) (← links)
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
- A multi-objective optimization method of flexible job-shop lot-splitting scheduling (Q2886120) (← links)
- Solving multi-objective job shop problem using nature-based algorithms: new Pareto approximation features (Q2980949) (← links)
- Flexible job-shop scheduling with transportation resources (Q6087485) (← links)
- Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem (Q6106559) (← links)
- Efficient multi-objective metaheuristic algorithm for sustainable harvest planning problem (Q6106604) (← links)
- An improved MOEA/D for multi-objective flexible job shop scheduling by considering efficiency and cost (Q6568497) (← links)