| Tekijä: | Neebe, A. W. |
| Otsikko: | An improved, multiplier adjustment procedure for the segregated storage problem |
| Lehti: | Journal of the Operational Research Society
1987 : SEP, VOL. 38:9, p.815-825 |
| Asiasana: | DISTRIBUTION INTEGER PROGRAMMING RESOURCE ALLOCATION |
| Kieli: | eng |
| Tiivistelmä: | The segregated storage problem consists of determining an optimal distribution of products among existing storage compartments such that at most one product may be stored in a given compartment. Linear programming combined with Langrangean relaxation is an effective technique for solving this problem. These techniques are shown to be particularly powerful as a heuristic quickly to obtain excellent quality solutions with guaranteed lower bounds. Computational results are also given, which show that in summary, all problems were solved to optimality. |
SCIMA