Due-window assignment with identical jobs on parallel uniform machines.
Enrique GerstlGur MosheiovPublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- identical machines
- parallel machines
- processing times
- scheduling problem
- single machine
- job scheduling
- precedence constraints
- flowshop
- identical parallel machines
- setup times
- shared memory
- sequence dependent setup times
- window size
- optimal scheduling
- parallel processing
- polynomial time approximation
- massively parallel
- release dates
- parallel computing
- sliding window
- batch processing machines
- processing units
- minimize total
- distributed memory
- data sets
- evolutionary algorithm