Approximation algorithms for multi-agent scheduling to minimize total weighted completion time.
Kangbok LeeByung-Cheon ChoiJoseph Y.-T. LeungMichael L. PinedoPublished in: Inf. Process. Lett. (2009)
Keyphrases
- minimize total
- approximation algorithms
- release dates
- precedence constraints
- single machine
- np hard
- parallel machines
- weighted tardiness
- scheduling problem
- total cost
- special case
- worst case
- sequence dependent setup times
- processing times
- single machine scheduling problem
- optimal solution
- reinforcement learning
- tabu search
- knapsack problem
- dynamic programming
- setup times