Minimizing tardy jobs in a flowshop with common due date.
Federico Della CroceJatinder N. D. GuptaRoberto TadeiPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- number of tardy jobs
- single machine
- flowshop
- scheduling problem
- processing times
- completion times
- total weighted tardiness
- total tardiness
- maximum lateness
- sequence dependent setup times
- single machine scheduling problem
- setup times
- release dates
- bicriteria
- makespan minimization
- flowshop scheduling
- precedence constraints
- tabu search
- np hard
- minimizing makespan
- identical parallel machines
- special case
- strongly np hard
- parallel machines
- production scheduling
- neural network
- competitive ratio
- permutation flowshop
- flowshop scheduling problems
- dispatching rule
- polynomially solvable
- dynamic programming
- computational complexity