An improved lower bound for the blocking permutation flow shop with total completion time criterion.
Marcelo Seido NaganoJoão Vítor Silva RobazziCaio Paziani TomazellaPublished in: Comput. Ind. Eng. (2020)
Keyphrases
- flowshop
- lower bound
- total flowtime
- scheduling problem
- upper bound
- permutation flowshop
- np hard
- flowshop scheduling problems
- completion times
- job processing times
- strongly np hard
- processing times
- setup times
- flowshop scheduling
- special case
- tabu search
- minimizing makespan
- branch and bound algorithm
- lot streaming
- sequence dependent setup times
- objective function
- competitive ratio
- single machine
- branch and bound
- asymptotic optimality
- makespan minimization
- optimal solution
- lower and upper bounds
- unrelated parallel machines
- precedence constraints
- parallel machines
- maximum lateness
- job shop
- worst case
- lagrangian relaxation
- buffer allocation
- open shop
- multi objective
- greedy algorithm
- genetic algorithm