Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time.
Harun AydilekAli AllahverdiPublished in: Comput. Math. Appl. (2010)
Keyphrases
- flowshop
- processing times
- scheduling problem
- release dates
- single machine
- parallel machines
- sequence dependent setup times
- minimizing total tardiness
- setup times
- makespan minimization
- single machine scheduling problem
- tabu search
- total weighted tardiness
- minimizing makespan
- np hard
- precedence constraints
- bicriteria
- strongly np hard
- polynomially solvable
- number of tardy jobs
- completion times
- special case
- competitive ratio
- job processing times
- job shop scheduling problem