Pages that link to "Item:Q857297"
From MaRDI portal
The following pages link to An exact parallel method for a bi-objective permutation flowshop problem (Q857297):
Displaying 9 items.
- Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q279989) (← links)
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334) (← links)
- Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q474788) (← links)
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (Q869006) (← links)
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (Q1046704) (← links)
- Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems (Q2379522) (← links)
- A criterion space decomposition approach to generalized tri-objective tactical resource allocation (Q6067194) (← links)
