Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach.
Natalia V. ShakhlevichAkiyoshi ShiouraVitaly A. StrusevichPublished in: ESA (2008)
Keyphrases
- scheduling problem
- single machine
- optimization problems
- orders of magnitude
- discrete optimization
- computational cost
- evolution strategy
- data structure
- computational complexity
- theoretical analysis
- efficient optimization
- optimization algorithm
- np hard
- tabu search
- global optimization
- benchmark datasets
- optimization procedure
- job shop scheduling problem
- learning algorithm