haku: @indexterm Scheduling / yhteensä: 635
viite: 269 / 635
| Tekijä: | Panwalkar, S. Smith, M. Koulamas, C. |
| Otsikko: | A heuristic for the single machine tardiness problem |
| Lehti: | European Journal of Operational Research
1993 : NOV 12, VOL. 70:3, p. 304-310 |
| Asiasana: | SCHEDULING HEURISTIC METHODS OPERATIONAL RESEARCH |
| Kieli: | eng |
| Tiivistelmä: | A heuristic (P-S-K) is presented in this paper for minimizing the mean tardiness for the single machine sequencing problem. This heuristic is compared with other available construction heuristics from the literature like the Wilkerson - Irwin (W-I), Holsenback - Russel (H-R) and API heuristics. It is shown that P-S-K yields better results than the other methods on a wide range of problems. Furthermore, as due dates become tight, P-S-K is substantially better than the other methods with respect to computational time. |
SCIMA