Solutions for the constrained dynamic facility layout problem
Article Abstract:
The constrained dynamicplant layout problem (CDPLP) is modeled as a singly constrained shortest-path problem (CSP) with financial limitations as the constraint on layout arrangement. Comparison with dynamic programming reveals that better results are obtained from the CSP in most test cases. Solutions to the problem using randomly generated static layouts approximated results derived by using the best layout method. Furthermore, the use of heuristic static layout solutions proved better than random selection of candidate static layouts. The model can be adapted to other constraints, such as 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:
Modeling uncertainties in plant layout problems
Article Abstract:
A mathematical programming model and solution methods that consider modeling uncertainties were developed for the determination of the optimal master facilities layout. Dynamic programming was utilized in an optimization procedure to solve the stochastic dynamic plant layout problem. This involved the designation of a stage to be a time period and of a state variable to be the layout. The cost of plans developed in this manner were found to be competitive for all periods.
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:
A nonlinear optimization approach for solving facility layout problems
Article Abstract:
The nonlinear optimizationlayout technique (NLT) is a heuristic algorithm developed to minimize the cost for facility layouts, where cost is a function of the relative location of departments. Applications show that NLT is a low-cost procedure that yields effective and accurate solutions within minimal time. A simplified nongraphic version that can be run on a personal computer proves to be as practical and effective as the original algorithm.
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: Go forth and multiply. Taiwan's little problem. Go forth and multiply: the human genome
- Abstracts: South Africa looks for truth and hopes for reconciliation. A slap on the wrist
- Abstracts: Asia beckons. Dreamware: General Magic and Apple. 486 and counting
- Abstracts: A practical heuristic for a large scale vehicle routing problem. Postoptimizing equilibrium flows on large scale networks
- Abstracts: Economic purchasing strategies for temporary price discounts. A distribution multi-echelon lot-size model