Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions.
Lei LiuMarcello UrgoPublished in: Ann. Oper. Res. (2024)
Keyphrases
- flowshop
- scheduling problem
- branch and bound
- unrelated parallel machines
- parallel machines
- sequence dependent setup times
- strongly np hard
- asymptotic optimality
- combinatorial optimization
- processing times
- tabu search
- setup times
- np hard
- maximum lateness
- single machine
- search algorithm
- beam search
- lower bound
- optimal solution
- scheduling jobs
- minimizing makespan
- branch and bound algorithm
- tree search
- special case
- job shop
- job shop scheduling problem
- tree search algorithm
- precedence constraints
- upper bound
- lot streaming
- branch and bound method
- open shop
- branch and bound procedure
- release dates
- search space
- job processing times
- completion times
- worst case
- branch and bound search
- optimization problems
- flowshop scheduling problems
- permutation flowshop
- column generation
- manufacturing cell
- cost function
- simulated annealing
- lagrangian heuristic