Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan.
Kejun ZhaoXiwen LuPublished in: J. Comb. Optim. (2016)
Keyphrases
- approximation algorithms
- parallel machines
- precedence constraints
- scheduling problem
- np hard
- open shop
- unrelated parallel machines
- vertex cover
- minimize total
- special case
- sequence dependent setup times
- scheduling jobs
- release dates
- weighted tardiness
- minimum cost
- worst case
- shared memory
- parallel computing
- setup times
- constant factor
- lower bound
- lot sizing
- single server
- single machine
- flowshop
- single machine scheduling problem
- integer programming
- multistage
- job shop
- linear programming
- branch and bound algorithm
- combinatorial auctions
- processing times