Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time.
Jatinder N. D. GuptaAlex J. Ruiz-TorresS. WebsterPublished in: J. Oper. Res. Soc. (2003)
Keyphrases
- number of tardy jobs
- parallel machines
- flowshop
- scheduling problem
- single machine scheduling problem
- precedence constraints
- single machine
- minimizing makespan
- processing times
- bicriteria
- special case
- np hard
- tabu search
- parallel computing
- completion times
- combinatorial optimization
- graphical models
- markov random field