An upper bound for the inter-exit time of two jobs in an m-machine flow shop.
Marcello UrgoMassimo ManziniPublished in: Ann. Oper. Res. (2024)
Keyphrases
- flowshop
- upper bound
- scheduling problem
- processing times
- lower bound
- special case
- total tardiness
- flowshop scheduling
- sequence dependent setup times
- bicriteria
- setup times
- minimizing makespan
- maximum lateness
- minimizing total tardiness
- makespan minimization
- asymptotic optimality
- worst case
- branch and bound algorithm
- tabu search
- strongly np hard
- np hard
- lower and upper bounds
- permutation flowshop
- single machine
- completion times
- precedence constraints
- total weighted tardiness
- branch and bound
- unrelated parallel machines
- flowshop scheduling problems
- parallel machines
- robotic cell
- lot streaming
- job shop scheduling
- open shop
- job processing times
- metaheuristic
- single machine scheduling problem
- computational complexity