A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem.
Claudio T. BornsteinLuciane Ferreira AlcoforadoNelson MaculanPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- scheduling problem
- parallel machines
- number of late jobs
- single machine
- release times
- total tardiness
- sequence dependent setup times
- scheduling jobs
- flowshop
- earliness tardiness
- unrelated parallel machines
- setup times
- precedence constraints
- processing times
- release dates
- np hard
- tabu search
- single server
- completion times
- learning effect
- special case
- strongly np hard
- identical machines
- markov random field