Heuristic algorithms for the minmax regret flow-shop problem with interval processing times.
Michal CwikJerzy JózefczykPublished in: Central Eur. J. Oper. Res. (2018)
Keyphrases
- processing times
- minmax regret
- flowshop
- interval data
- scheduling problem
- single machine scheduling problem
- shortest path problem
- setup times
- makespan minimization
- sequence dependent setup times
- special case
- single machine
- release dates
- total weighted tardiness
- tabu search
- scheduling jobs
- polynomially solvable
- shortest path
- resource consumption
- np hard
- strongly np hard
- parallel machines
- job shop
- search algorithm