haku: @indexterm LINEAR PROGRAMMING / yhteensä: 544
viite: 86 / 544
Tekijä: | Dauzere-Peres, S. |
Otsikko: | Minimizing late jobs in the general one machine scheduling problem |
Lehti: | European Journal of Operational Research
1995 : FEB 16, VOL. 81:1, p. 134-142 |
Asiasana: | SCHEDULING LINEAR PROGRAMMING HEURISTIC METHODS |
Kieli: | eng |
Tiivistelmä: | In this paper, the problem of minimizing the number of late jobs on one machine is investigated. The general problem is considered, i.e., with release dates and different due dates. a lower bound is first proposed, based on the relaxation of a Mixed-Integer Linear Programming formulation of the problem. a heuristic is then presented. Its effectiveness is computationally studied by comparison with the lower bound. |
SCIMA