Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times.
Anis GharbiTalel LadhariMohamed Kais MsakniMehdi SerairiPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- flowshop
- setup times
- scheduling problem
- lower bound
- strongly np hard
- np hard
- sequence dependent setup times
- processing times
- special case
- bicriteria
- upper bound
- makespan minimization
- single machine
- unrelated parallel machines
- minimizing makespan
- total tardiness
- manufacturing cell
- tabu search
- objective function
- lower and upper bounds
- branch and bound
- parallel machines
- branch and bound algorithm
- multi item
- worst case
- approximation algorithms
- lagrangian relaxation
- completion times
- optimization problems
- np complete