haku: @author Shamir, R. / yhteensä: 3
viite: 1 / 3
« edellinen | seuraava »
| Tekijä: | Hochbaum, D. S. Shamir, R. |
| Otsikko: | Strongly polynomial algorithms for the high multiplicity scheduling problem |
| Lehti: | Operations Research
1991 : JUL-AUG, VOL. 39:4, p. 648-653 |
| Asiasana: | SCHEDULING ALGORITHMS OPTIMIZATION MEASUREMENT PROBLEM SOLVING |
| Kieli: | eng |
| Tiivistelmä: | The typical scheduling problem is as follows: There is a list of jobs, and each job has a set of characteristic parameters. The goal is to find a schedule that minimizes a specified measure of efficiency /lateness etc./. This is the classical representation of the problem. In the article the so called high multiplicity problems are investigated, in which the jobs can be partitioned into relatively few groups, and they have the same set of parameters. Strongly polynomial algorithms are provided constructing optimal schedules with respect to several measures. |
« edellinen | seuraava »
SCIMA