Minimizing maximum earliness on parallel identical machines.
Micha MandelGur MosheiovPublished in: Comput. Oper. Res. (2001)
Keyphrases
- identical machines
- single machine
- weighted number of tardy jobs
- processing times
- scheduling problem
- job scheduling
- single machine scheduling problem
- setup times
- release dates
- dynamic programming
- sequence dependent setup times
- precedence constraints
- flowshop
- single machine scheduling
- resource consumption
- evolutionary algorithm
- parallel machines
- steady state
- np hard