Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits.
Xiaojuan JiangKangbok LeeMichael L. PinedoPublished in: J. Sched. (2024)
Keyphrases
- flowshop
- flowshop scheduling
- bicriteria
- approximation algorithms
- special case
- scheduling problem
- np hard
- processing times
- strongly np hard
- vertex cover
- setup times
- sequence dependent setup times
- minimum cost
- worst case
- minimizing makespan
- approximation ratio
- manufacturing cell
- precedence constraints
- single machine
- tabu search
- parallel machines
- computational complexity
- primal dual
- np complete
- efficient solutions
- constant factor approximation
- integer programming
- linear programming
- knapsack problem
- cost function
- lower bound
- neural network