| Tekijä: | Paletta, G. |
| Otsikko: | A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints. |
| Lehti: | European Journal of Operational Research
1987 : JUL, VOL. 31:1, p. 71-77 |
| Asiasana: | DISTRIBUTION INTEGER PROGRAMMING OPTIMIZATION |
| Kieli: | eng |
| Tiivistelmä: | The scheduling problem for pseudo-cyclic deliveries under window constraints is presented. The problem is formulated as a linear integer programming problem, where the objective function represented the minimization of the centralized supplier capacity needed to satisfy all user requests over a discretized planning horizon of infinitive length. A heuristic algorithm running in polynomial time is illustrated and experimental analysis of its efficiency is presented. |
SCIMA