A branch-and-bound approach to the no-idle flowshop scheduling problem.
Bassem JarbouiMansour EddalyPublished in: Discret. Appl. Math. (2024)
Keyphrases
- branch and bound
- flowshop
- scheduling problem
- lower bound
- search algorithm
- branch and bound algorithm
- np hard
- upper bound
- column generation
- single machine
- optimal solution
- setup times
- processing times
- minimizing makespan
- search space
- minimizing total tardiness
- tabu search
- combinatorial optimization
- flowshop scheduling
- total tardiness
- maximum lateness
- bicriteria
- sequence dependent setup times
- special case
- branch and bound procedure
- makespan minimization
- total weighted tardiness
- precedence constraints
- total flowtime
- parallel machines
- permutation flowshop
- flowshop scheduling problems
- objective function
- lower and upper bounds
- strongly np hard
- computational complexity
- job shop scheduling problem
- simulated annealing