Solutions for the constrained dynamic facility layout problem
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Balakrishnan, Jaydeep & Cheng, Chun Hung, 1998. "Dynamic layout algorithms: a state-of-the-art survey," Omega, Elsevier, vol. 26(4), pages 507-521, August.
- Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
- Akash Tayal & Surya Prakash Singh, 2019. "Formulating multi-objective stochastic dynamic facility layout problem for disaster relief," Annals of Operations Research, Springer, vol. 283(1), pages 837-863, December.
- Baykasoglu, Adil & Dereli, Turkay & Sabuncu, Ibrahim, 2006. "An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems," Omega, Elsevier, vol. 34(4), pages 385-396, August.
- E Erel & J B Ghosh & J T Simon, 2003. "New heuristic for the dynamic layout problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1275-1282, December.
- Dunker, Thomas & Radons, Gunter & Westkamper, Engelbert, 2005. "Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem," European Journal of Operational Research, Elsevier, vol. 165(1), pages 55-69, August.
- Balakrishnan, Jaydeep & Cheng, Chun Hung & Conway, Daniel G. & Lau, Chun Ming, 2003. "A hybrid genetic algorithm for the dynamic plant layout problem," International Journal of Production Economics, Elsevier, vol. 86(2), pages 107-120, November.
- Akash Tayal & Angappa Gunasekaran & Surya Prakash Singh & Rameshwar Dubey & Thanos Papadopoulos, 2017. "Formulating and solving sustainable stochastic dynamic facility layout problem: a key to sustainable operations," Annals of Operations Research, Springer, vol. 253(1), pages 621-655, June.
- Yang, Taho & Peters, Brett A., 1998. "Flexible machine layout design for dynamic and uncertain production environments," European Journal of Operational Research, Elsevier, vol. 108(1), pages 49-64, July.
- He, N. & Zhang, D.Z. & Li, Q., 2014. "Agent-based hierarchical production planning and scheduling in make-to-order manufacturing system," International Journal of Production Economics, Elsevier, vol. 149(C), pages 117-130.
- Saif Benjaafar & Sunderesh S. Heragu & Shahrukh A. Irani, 2002. "Next Generation Factory Layouts: Research Challenges and Recent Progress," Interfaces, INFORMS, vol. 32(6), pages 58-76, December.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:57:y:1992:i:2:p:280-286. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.