|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 2 van 14 gevonden artikelen
| Titel: |
An Investigation of Branch and Bound Methods for Solving the Segregated Storage Problem |
| Auteur: |
Dannenbring, David G. Khumawala, Basheer M. |
| Verschenen in: |
IIE transactions |
| Paginering: | Jaargang 5 (1973) nr. 3 pagina's 265-274 |
| Jaar: |
1973-09-01 |
| Inhoud: |
The segregated storage problem consists of determining a minimum cost distribution of products among compartments such that only one product may be stored in a given compartment. This paper explores the computational aspects of using branch and bound methods to solve this problem. Such methods were first suggested for this problem by White and Francis. A variety of approaches are tested, utilizing heuristic node selection and branching decision rules. Three heuristics are also presented which generate solutions for use as initial upper bounds for improving efficiency of the branch and bound procedure or as solutions for very large problems. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 2 van 14 gevonden artikelen
| << vorige | volgende >> |