New applications of the Muntz and Coffman algorithm
β Scribed by Maciej Drozdowski
- Publisher
- Springer US
- Year
- 2001
- Tongue
- English
- Weight
- 214 KB
- Volume
- 4
- Category
- Article
- ISSN
- 1094-6136
- DOI
- 10.1002/jos.76
No coin nor oath required. For personal study only.
β¦ Synopsis
Muntz and Co man proposed an algorithm to solve the problem of scheduling preemptable tasks either with arbitrary precedences on two processors, or tasks with tree-like precedences on an arbitrary number of processors, for the schedule length criterion. In this work, we demonstrate that this well-known algorithm has interesting features which extend its application to many other scheduling problems. Three deterministic scheduling problems for preemptable tasks are considered. Though these problems have diverse formulations, they have at least one thing in common: Basically their optimization algorithms boil down to the Muntz-Co man algorithm. The foundations of the Muntz-Co man algorithm versatility are established.
π SIMILAR VOLUMES
Fragmental methods (FMs) have great potential in many practical areas related to the design of new lead compounds. Advanced Algorithm Builder TM (AAB) is a new software system which employs FMs in (i) building QSPR, QSAR and SAR models, (ii) converting them to custom (in-house) algorithms and screen
The main objective of this paper is to apply new systems techniques for condensing information that is contained in a reliability data set. These techniques, augmented with the Greedy Algorithm, were used to develop an algorithm for reduced data set reconstruction. The techniques go beyond tradition
discover The Benefits Of Applying Algorithms To Solve Scientific, Engineering, And Practical Problems Providing A Combination Of Theory, Algorithms, And Simulations, Handbook Of Applied Algorithms Presents An All-encompassing Treatment Of Applying Algorithms And Discrete Mathematics To Practi