Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines.
Luca BecchettiStefano LeonardiPublished in: J. ACM (2004)
Keyphrases
- parallel machines
- scheduling problem
- unrelated parallel machines
- minimize total
- sequence dependent setup times
- weighted tardiness
- release dates
- precedence constraints
- total tardiness
- massively parallel
- scheduling jobs
- maximum lateness
- single machine
- setup times
- parallel computing
- open shop
- decision making
- single machine scheduling problem
- computational complexity
- lot sizing
- evolutionary algorithm
- identical parallel machines
- special case
- tabu search
- steady state