Pareto approximations for the bicriteria scheduling problem.
Vittorio BilòMichele FlamminiLuca MoscardelliPublished in: J. Parallel Distributed Comput. (2006)
Keyphrases
- bicriteria
- flowshop
- scheduling problem
- maximum tardiness
- processing times
- minimizing makespan
- setup times
- single machine
- multi objective
- np hard
- special case
- tabu search
- parallel machines
- completion times
- efficient solutions
- multi objective optimization
- precedence constraints
- integer linear programming
- genetic algorithm
- knapsack problem
- convex hull
- linear combination
- evolutionary algorithm