haku: @indexterm Quadratic programming / yhteensä: 24
viite: 14 / 24
| Tekijä: | Zipkin, P. H. |
| Otsikko: | Computing optimal lot sizes in the economic lot scheduling problem. |
| Lehti: | Operations Research
1991 : JAN-FEB, VOL. 39:1, p. 56-63 |
| Asiasana: | LOT-SIZE MODEL QUADRATIC PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | An Economic Lot Scheduling Problem /ELSP/ is described in which there are several items, all of which must be produced on a single machine, and the machine can make only one product at a time. The computation of optimal lot sizes and cycle length are shown, the sequence of items in a cycle is given. This requires a few EOQ calculations and solving a parametric quadratic program. The procedure is designed to be used along with a heuristic for selecting the sequence of items in a cycle. The two algorithms together comprise a simple, plausible heuristic for the ELSP as a whole. The proposed algorithm is compared to a general purpose, nonlinear program solver on a set of randomly generated test problems. |
SCIMA