Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion.
Fernando Luis RossiMarcelo Seido NaganoPublished in: OR Spectr. (2022)
Keyphrases
- total flowtime
- beam search
- flowshop
- scheduling problem
- flowshop scheduling problems
- permutation flowshop
- minimizing makespan
- flowshop scheduling
- search algorithm
- heuristic search
- branch and bound
- search methods
- upper bound
- special case
- single machine
- sequence dependent setup times
- processing times
- search problems
- parallel machines
- maximum lateness
- setup times
- ranking functions
- precedence constraints
- tabu search
- greedy algorithm
- np hard
- ant colony optimization
- hill climbing
- objective function
- orders of magnitude
- search strategy
- state space