Two-stage Assembly Flowshop Scheduling Problem With Bi-objective of Number of Tardy and Makespan Minimization.
Javad NavaeiAshkan MozdgirHooman HidajiPublished in: IC-AI (2010)
Keyphrases
- scheduling problem
- flowshop
- makespan minimization
- single machine
- processing times
- parallel machines
- setup times
- total weighted tardiness
- np hard
- tabu search
- job shop scheduling problem
- minimizing makespan
- precedence constraints
- special case
- bi objective
- job shop
- sequence dependent setup times
- release dates
- permutation flowshop
- computational complexity
- dynamic programming
- multi objective
- job processing times
- directed graph
- upper bound
- polynomially solvable