An improved procedure for solving minimum makespan on a flowshop.
David FreudAmir ElaloufPublished in: CoDIT (2022)
Keyphrases
- flowshop
- scheduling problem
- minimizing makespan
- strongly np hard
- special case
- processing times
- setup times
- flowshop scheduling
- bicriteria
- flowshop scheduling problems
- sequence dependent setup times
- maximum tardiness
- lot streaming
- np hard
- tabu search
- makespan minimization
- parallel machines
- total tardiness
- maximum lateness
- single machine
- job shop
- permutation flowshop
- minimum cost
- release dates
- total weighted tardiness
- job shop scheduling problem
- open shop
- lower bound
- unrelated parallel machines
- feasible solution
- search space