Pages that link to "Item:Q336334"
From MaRDI portal
The following pages link to Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334):
Displaying 7 items.
- Optimizing of bullwhip effect and net stock amplification in three-echelon supply chains using evolutionary multi-objective metaheuristics (Q324324) (← links)
- Algorithms for bicriteria minimization in the permutation flow shop scheduling problem (Q542590) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem (Q1791932) (← links)
- Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940) (← links)
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs (Q2566710) (← links)
- Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time (Q6090472) (← links)
