haku: @author Rajendran, C. / yhteensä: 9
viite: 5 / 9
| Tekijä: | Rajendran, C. |
| Otsikko: | Heuristics for scheduling in flowshop with multiple objectives |
| Lehti: | European Journal of Operational Research
1995 : MAY 4, VOL. 82:3, p. 540-555 |
| Asiasana: | OPERATIONAL RESEARCH HEURISTIC METHODS MANAGEMENT |
| Kieli: | eng |
| Tiivistelmä: | Most of the heuristics for flowshop scheduling aim at minimizing makespan. However, scheduling with multiple objective, such as that of minimizing makespan, total flowtime and machine time, is more effective in reducing the total scheduling cost. In this article, the author first addresses the problem of scheduling to minimize makespan and total flowtime, and proposes a new algorithm. A heuristic preference relation is developed as the basis for the heuristic so that only the potential job interchanges are checked for possible improvement with respect to these two objectives. |
SCIMA