An approximation algorithm for identical parallel machine scheduling with resource dependent processing times.
Hans KellererPublished in: Oper. Res. Lett. (2008)
Keyphrases
- processing times
- worst case performance ratio
- competitive ratio
- computational complexity
- objective function
- setup times
- np hard
- dynamic programming
- learning algorithm
- worst case
- simulated annealing
- optimal solution
- resource allocation
- single machine
- scheduling problem
- cost function
- search procedure
- benchmark problems
- neural network
- lower bound
- single machine scheduling problem
- execution times
- average case
- particle swarm optimization
- linear programming
- upper bound