A two-machine flowshop scheduling problem with precedence constraint on two jobs.
Shuenn-Ren ChengYunqiang YinChih-Hou WenWin-Chin LinChin-Chia WuJun LiuPublished in: Soft Comput. (2017)
Keyphrases
- flowshop
- scheduling problem
- precedence constraints
- processing times
- sequence dependent setup times
- minimizing total tardiness
- minimizing makespan
- setup times
- single machine
- maximum lateness
- flowshop scheduling
- strongly np hard
- special case
- total tardiness
- np hard
- parallel machines
- bicriteria
- tabu search
- total weighted tardiness
- makespan minimization
- unrelated parallel machines
- flowshop scheduling problems
- robotic cell
- permutation flowshop
- parallel machine scheduling problem
- job processing times
- job shop
- job shop scheduling problem
- preventive maintenance
- release dates
- single machine scheduling problem
- maximum tardiness
- number of tardy jobs
- scheduling jobs
- genetic algorithm
- global constraints
- evolutionary algorithm