Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
Chandrasekharan RajendranHans ZieglerPublished in: Eur. J. Oper. Res. (2003)
Keyphrases
- completion times
- sequence dependent setup times
- flowshop
- weighted tardiness
- scheduling problem
- setup times
- single machine
- processing times
- total tardiness
- maximum lateness
- total weighted tardiness
- parallel machines
- minimizing total tardiness
- precedence constraints
- single machine scheduling problem
- tabu search
- special case
- job processing times
- release dates
- minimize total
- strongly np hard
- np hard
- job shop scheduling problem
- identical parallel machines
- multistage