Dynamic layout design given a scenario tree of probable futures
Article Abstract:
A dynamic layout design model was developed by taking into consideration the future behavior and uncertainties of requirement sets. This model allows the scenario trees of probable futures to be developed. A requirement set represented as cell space and intercell interaction requirements are then specified for each future. These interaction requirements may be a combination of flow intensity and qualitative relationships. This design model was developed for use in conjunction with an overall dynamic layout design methodology.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
Flow network design for manufacturing systems layout
Article Abstract:
A facilities layout planning problem can be solved using a component approach involving block design, input/output station location, material flow network design and aisle setting. The material handling network design phase of the problem is translated into a multicommodity-flow based formulation. Lagrangean relaxation is used to break up the shortest rectilinear flow network problem into manageable components that can be solved through a two-phase heuristic in linear time.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
An O(nm) algorithm for a special case of the multimedian location problem on a tree
Article Abstract:
The multimedian location problem was solved via an O(nm) algorithm applied to a tree transport network. The problem involved n existing facilities occupying the vertices of a transport network and m new facilities which are to be located in the network. The distances between the facilities are the shortest-path distances along arcs of the network. Results indicated that Kolen's algorithm may be reduced from O(nm super 3) to O(nm) when the flow graph is series-parallel.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Dissent at your peril. The trouble with Harry. Trampled underfoot: dissidents caught up in Sino-U.S. clash
- Abstracts: Disarray in the ranks. Pole position ploys
- Abstracts: The people problem. After politics. The British referendum
- Abstracts: Exposing the concrete facts. Surface treatments. Making good
- Abstracts: Promoting study in the inner city. New facade on an original frame. Urban surgery on a flying lease