A Branch-and-Bound Method to Minimize the Total Flow Time in a Permutation Flow Shop with Blocking and Setup Times.
João Vítor Silva RobazziMarcelo Seido NaganoMauricio Iwama TakanoPublished in: ICPR-Americas (1) (2020)
Keyphrases
- setup times
- branch and bound method
- flowshop
- scheduling problem
- mixed integer programming
- lot sizing
- feasible solution
- branch and bound
- branch and bound algorithm
- tabu search
- lower bound
- lagrangian relaxation
- optimal configuration
- special case
- processing times
- sequence dependent setup times
- single machine
- unrelated parallel machines
- multi item
- np hard
- single machine scheduling problem
- precedence constraints
- manufacturing cell
- parallel machines
- strongly np hard
- mixed integer
- upper bound
- column generation
- optimal solution
- release dates
- genetic algorithm
- multistage
- search space
- open shop