Pareto Approximations for the Bicriteria Scheduling Problem.
Vittorio BilòMichele FlamminiLuca MoscardelliPublished in: IPDPS (2004)
Keyphrases
- bicriteria
- flowshop
- scheduling problem
- maximum tardiness
- multi objective
- processing times
- setup times
- tabu search
- single machine
- minimizing makespan
- completion times
- special case
- efficient solutions
- np hard
- precedence constraints
- multi objective optimization
- parallel machines
- genetic algorithm
- evolutionary algorithm
- shortest path problem
- lower bound
- hybrid algorithm
- objective function
- supply chain