Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Mathematical methods of operations research (Heidelberg, Germany), 2010-10, Vol.72 (2), p.205-216
2010
Volltextzugriff (PDF)

Details

Autor(en) / Beteiligte
Titel
On the unboundedness of facility layout problems
Ist Teil von
  • Mathematical methods of operations research (Heidelberg, Germany), 2010-10, Vol.72 (2), p.205-216
Ort / Verlag
Berlin/Heidelberg: Springer-Verlag
Erscheinungsjahr
2010
Quelle
EBSCOhost Business Source Ultimate
Beschreibungen/Notizen
  • Facility layout problems involve the location of facilities in a planar arrangement such that facilities that are strongly connected to one another are close to each other and facilities that are not connected may be far from one another. Pairs of facilities that have a negative connection should be far from one another. Most solution procedures assume that the optimal arrangement is bounded and thus do not incorporate constraints on the location of facilities. However, especially when some of the coefficients are negative, it is possible that the optimal configuration is unbounded. In this paper we investigate whether the solution to the facility layout problem is bounded or not. The main Theorem is a necessary and sufficient condition for boundedness. Sufficient conditions that prove boundedness or unboundedness are also given.

Weiterführende Literatur

Empfehlungen zum selben Thema automatisch vorgeschlagen von bX