A Simple Lower Bound for total Completion Time Minimization in a Two-Machine flowshop.
Bertrand M. T. LinJ. M. WuPublished in: Asia Pac. J. Oper. Res. (2005)
Keyphrases
- flowshop
- lower bound
- scheduling problem
- strongly np hard
- objective function
- flowshop scheduling
- job processing times
- special case
- np hard
- upper bound
- minimizing makespan
- bicriteria
- maximum lateness
- processing times
- total tardiness
- sufficiently accurate
- flowshop scheduling problems
- sequence dependent setup times
- setup times
- total weighted tardiness
- minimizing total tardiness
- branch and bound
- makespan minimization
- preventive maintenance
- branch and bound algorithm
- robotic cell
- completion times
- permutation flowshop
- parallel machines
- tabu search
- worst case
- approximation algorithms
- single machine
- cost function
- multi objective
- optimal solution