A local search using solution fragments for the 2-machine bicriteria scheduling problem.
Gaofeng HuangAndrew LimBrian RodriguesPublished in: Comput. Optim. Appl. (2007)
Keyphrases
- flowshop
- bicriteria
- scheduling problem
- tabu search
- efficient solutions
- maximum tardiness
- processing times
- optimal solution
- single machine
- minimizing makespan
- search procedure
- setup times
- np hard
- special case
- simulated annealing
- completion times
- knapsack problem
- manufacturing cell
- parallel machines
- search algorithm
- search space
- integer linear programming
- strongly np hard
- genetic algorithm
- metaheuristic
- precedence constraints
- integer programming
- differential evolution