haku: @indexterm Scheduling / yhteensä: 635
viite: 383 / 635
| Tekijä: | Anderson, E. J. |
| Otsikko: | Testing feasibility in a lot scheduling problem |
| Lehti: | Operations Research
1990 : NOV-DEC, VOL. 38:2, p. 1079-1088 |
| Asiasana: | LOT-SIZE MODEL SCHEDULING PRODUCTION COSTS HEURISTIC METHODS |
| Kieli: | eng |
| Tiivistelmä: | A version of the Economic Lot Scheduling Problem /ELSP/ in which there are no costs specified is investigated. The usual form of this problem seeks a pattern of production that minimizes the sum of holding the setup costs. The problem of finding a feasible schedule which avoids the stockout given the initial stocks of the products being manufactured is considered. It is shown that this problem is NP-hard, and an effective heuristic method for its solution is proposed. This heuristic method is compared with a more naive approach to the problem and some computational results are given. |
SCIMA