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):
Displayed 6 items.
- 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)
- 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)