New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs.
Fatih Safa ErenayIhsan SabuncuogluAysegül ToptalManoj Kumar TiwariPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- scheduling problem
- single machine
- flowshop
- bicriteria
- number of tardy jobs
- processing times
- total weighted tardiness
- setup times
- maximum lateness
- earliness tardiness
- total tardiness
- sequence dependent setup times
- tabu search
- maximum tardiness
- precedence constraints
- np hard
- single machine scheduling problem
- completion times
- efficient solutions
- release dates
- minimizing makespan
- dynamic programming