Name
Abstract | ||
|---|---|---|
The scheduling problem of cyclic deliveries presented in this paper is characterized by a set of customers requiring, from a centralized supplier, stochastically varying quantities of a given commodity with prefixed time periodicity. The model is of the multiobjective type; the customers are scheduled in order to minimize both the mean value and the variance of the capacity of the distribution system. A heuristic algorithm to solve this problem in polynomial time is described and an experimental analysis of its performance is presented. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1016/0305-0548(88)90051-2 | Computers & OR |
Keywords | DocType | Volume |
cyclic delivery,Mean-variance approach | Journal | 15 |
Issue | ISSN | Citations |
6 | Computers and Operations Research | 1 |
PageRank | References | Authors |
0.43 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Cerulli | 1 | 252 | 23.85 |
| M. Gaudioso | 2 | 172 | 11.39 |