A random polynomial time algorithm for approximating the volume of convex bodies
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Minimizing total tardiness on one machine is NP-hard
Mathematics of Operations Research
Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Production and Stabilization of Real-Time Task Schedules
Journal of the ACM (JACM)
Nested Partitions Method for Global Optimization
Operations Research
Polynomial complete scheduling problems
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
Applicability of simulated annealing methods to real-time scheduling and jitter control
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
| Hi-index | 0.00 |
Many real-time scheduling problems are proven to be NP-hard. Recently, we proposed a randomized optimization framework for efficiently solving such NP-hard problems. The proposed method, the Nested Partitions (NP) method, has been proved to converge to global optimal solutions and it is also highly matched to emerging massively parallel processing capabilities. Especially, we apply the NP method to solve the scheduling real-time tasks with minimum jitter.