An O(n log n) Feasibility Algorithm for Preemptive Scheduling of n Independent Jobs on a Hypercube.
Mohan AhujaYahui ZhuPublished in: Inf. Process. Lett. (1990)
Keyphrases
- preemptive scheduling
- preprocessing
- k means
- worst case
- detection algorithm
- optimization algorithm
- dynamic programming
- computational cost
- convergence rate
- expectation maximization
- learning algorithm
- probabilistic model
- computational complexity
- np hard
- cost function
- significant improvement
- objective function
- similarity measure
- search procedure
- space complexity
- single machine scheduling problem
- image segmentation