haku: @author Mukhopadhyay, S. / yhteensä: 2
viite: 2 / 2
« edellinen | seuraava »
| Tekijä: | Szwarc, W. Mukhopadhyay, S. |
| Otsikko: | Minimizing a quadratic cost function of waiting times in single-machine scheduling |
| Lehti: | Journal of the Operational Research Society
1995 : JUN, VOL. 46:6, p. 753-761 |
| Asiasana: | OPERATIONAL RESEARCH BRANCH AND BOUND METHODS SCHEDULING |
| Kieli: | eng |
| Tiivistelmä: | This paper deals with scheduling n jobs on a single machine in order to minimize the weighted sum of squared waiting times of the jobs. The authors present a powerful decomposition mechanism, based on a precedence relation concept, that easily handles problems of the size n-50 and 100 where the processing times and penalties are independently drawn from a uniform distribution. This mechanism is incorporated along with new branching rules in a branch-and-bound scheme that efficiently handles tough problems of the size 20 and 50. |
« edellinen | seuraava »
SCIMA