haku: @indexterm Confectioners, tobacconists and newsagents / yhteensä: 19
viite: 2 / 19
| Tekijä: | Kogan, K. Lou, S. |
| Otsikko: | Multi-stage newsboy problem: a dynamic model |
| Lehti: | European Journal of Operational Research
2003 : SEP, VOL. 149:2, p. 448-458 |
| Asiasana: | Operational research Optimization Confectioners, tobacconists and newsagents |
| Kieli: | eng |
| Tiivistelmä: | The paper focuses on a dynamic, continuous-time generalization of the single-period newsboy problem. It is characterized by a number of the newsboys whose operations are organized and controlled in sequential stages. The objective is to minimize shortage and surplus costs occurring at the end of the period as in the classical newsboy problem, as well as intermediate surplus costs incurring at each time point along the period. The authors prove that this consinuous-time problem can be reduced to a number of discrete-time problems. On this basis, a polynomial-time combinatorai algorithm is derived to find globally optimal solution when the system satisfies a certain capacity condition. |
SCIMA