Approximation schemes for two-agent scheduling on parallel machines.
Kejun ZhaoXiwen LuPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- parallel machines
- approximation schemes
- scheduling problem
- unrelated parallel machines
- approximation algorithms
- precedence constraints
- minimize total
- sequence dependent setup times
- release dates
- open shop
- weighted tardiness
- total tardiness
- scheduling jobs
- setup times
- shared memory
- parallel computing
- numerical methods
- flowshop
- lot sizing
- single server
- identical parallel machines
- single machine
- decision making
- simulated annealing
- evolutionary algorithm
- multiscale