A bicriteria two-machine permutation flowshop problem.
Funda Sivrikaya-SerifogluGündüz UlusoyPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- bicriteria
- flowshop
- permutation flowshop
- scheduling problem
- strongly np hard
- sequence dependent setup times
- single machine
- setup times
- processing times
- precedence constraints
- minimizing makespan
- parallel machines
- np hard
- tabu search
- efficient solutions
- completion times
- manufacturing cell
- release dates
- approximation algorithms
- knapsack problem
- integer linear programming
- greedy algorithm
- search algorithm
- special case
- search space
- lower bound