Pages that link to "Item:Q542590"
From MaRDI portal
The following pages link to Algorithms for bicriteria minimization in the permutation flow shop scheduling problem (Q542590):
Displaying 8 items.
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334) (← links)
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria (Q991843) (← links)
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem (Q1848361) (← links)
- A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking (Q2423281) (← links)
- Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm (Q2476643) (← links)
- P2P B&B and GA for the Flow-Shop Scheduling Problem (Q3603121) (← links)
- Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem (Q5059343) (← links)
