Permutation flowshop scheduling with time lag constraints and makespan criterion.
Bailin WangKai HuangTieke LiPublished in: Comput. Ind. Eng. (2018)
Keyphrases
- permutation flowshop
- scheduling problem
- total flowtime
- precedence constraints
- flowshop
- minimizing makespan
- np hard
- setup times
- single machine
- strongly np hard
- parallel machines
- tabu search
- processing times
- unrelated parallel machines
- job shop
- upper bound
- resource constraints
- sequence dependent setup times
- constraint satisfaction
- release dates
- maximum lateness
- identical parallel machines
- scheduling algorithm
- greedy algorithm
- flowshop scheduling
- deteriorating jobs
- optimal solution
- feasible solution
- lower bound