We give a new and efficient approximation algorithm for scheduling precedenceconstrained jobs on machines with different speeds. The problem is as follows. We are given n jobs to be scheduled on a set of m machines. Jobs have processing times and machines have speeds. It takes p j /s i units of time
On “an efficient algorithm for minimizing barrier and penalty functions”
✍ Scribed by Arie Tamir
- Publisher
- Springer-Verlag
- Year
- 1972
- Tongue
- English
- Weight
- 67 KB
- Volume
- 3-3
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In this study, a simple and efficient cyclic coordinate search procedure is used to optimize penalty functions. Since the contours of the penalty function are very ill‐behaved, an accurate line search is very difficult to achieve. Due to accumulated errors in line search, this makes “si
A simple class of algorithms for the efficient computation of the Hurwitz zeta and related special functions is given. The algorithms also provide a means of computing fundamental mathematical constants to arbitrary precision. A number of extensions as well as numerical examples are briefly describe