IDEAS home Printed from https://ideas.repec.org/p/hhs/uunewp/1999_013.html
   My bibliography  Save this paper

A Pure Binary LP Model to the Facility Layout Problem

Author

Listed:
  • Papahristodoulou, Christos

    (Department of Economics)

Abstract

In facility layout problems, a major concern is the optimal design or remodeling of the facilities of an organization. The decision maker’s objective is to arrange the facility in an optimal way, so that the interaction among functions (i.e. machines, inventories, persons) and places (i.e. offices, work locations, depots) is efficient. A simple pure-binary LP model is developed and solved for a small hospital, where five functions are to be redesigned to five different locations. The model is rather flexible and can be used, with small modifications, for larger facility layouts.

Suggested Citation

  • Papahristodoulou, Christos, 1999. "A Pure Binary LP Model to the Facility Layout Problem," Working Paper Series 1999:13, Uppsala University, Department of Economics.
    • Handle: RePEc:hhs:uunewp:1999_013
    as

    Download full text from publisher

    File URL: http://www.nek.uu.se/pdf/1999wp13.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Gordon C. Armour & Elwood S. Buffa, 1963. "A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities," Management Science, INFORMS, vol. 9(2), pages 294-309, January.
    2. Domschke, Wolfgang & Drexl, Andreas, 1985. "Location and layout planning – an international bibliography," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 36418, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Papahristodoulou, Christos, 2009. "The optimal layout of football players: A case study for AC Milan," MPRA Paper 20102, University Library of Munich, Germany.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lin, Jin-Ling & Foote, Bobbie & Pulat, Simin & Chang, Chir-Ho & Cheung, John Y., 1996. "Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes," European Journal of Operational Research, Elsevier, vol. 89(1), pages 135-146, February.
    2. Ali Derakhshan Asl & Kuan Yew Wong & Manoj Kumar Tiwari, 2016. "Unequal-area stochastic facility layout problems: solutions using improved covariance matrix adaptation evolution strategy, particle swarm optimisation, and genetic algorithm," International Journal of Production Research, Taylor & Francis Journals, vol. 54(3), pages 799-823, February.
    3. Lee, Geun-Cheol & Kim, Yeong-Dae, 2000. "Algorithms for adjusting shapes of departments in block layouts on the grid-based plane," Omega, Elsevier, vol. 28(1), pages 111-122, February.
    4. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    5. Zhongwei Zhang & Lihui Wu & Zhaoyun Wu & Wenqiang Zhang & Shun Jia & Tao Peng, 2022. "Energy-Saving Oriented Manufacturing Workshop Facility Layout: A Solution Approach Using Multi-Objective Particle Swarm Optimization," Sustainability, MDPI, vol. 14(5), pages 1-28, February.
    6. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    7. Daniel Serra & Charles Revelle, 1997. "Competitive location and pricing on networks," Economics Working Papers 219, Department of Economics and Business, Universitat Pompeu Fabra.
    8. Kazuhiro Tsuchiya & Sunil Bharitkar & Yoshiyasu Takefuji, 1996. "A neural network approach to facility layout problems," European Journal of Operational Research, Elsevier, vol. 89(3), pages 556-563, March.
    9. 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.
    10. Yu, Junfang & Sarker, Bhaba R., 2003. "Directional decomposition heuristic for a linear machine-cell location problem," European Journal of Operational Research, Elsevier, vol. 149(1), pages 142-184, August.
    11. Jerzy Grobelny & Rafal Michalski, 2016. "A concept of a flexible approach to the facilities layout problems in logistics systems," WORking papers in Management Science (WORMS) WORMS/16/11, Department of Operations Research and Business Intelligence, Wroclaw University of Science and Technology.
    12. Gomez, A. & Fernandez, Q. I. & De la Fuente Garcia, D. & Garcia, P. J., 2003. "Using genetic algorithms to resolve layout problems in facilities where there are aisles," International Journal of Production Economics, Elsevier, vol. 84(3), pages 271-282, June.
    13. N/A, 1993. "Letters to the Editor," Environment and Planning A, , vol. 25(3), pages 437-440, March.
    14. Krešimir Mihić & Kevin Ryan & Alan Wood, 2018. "Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 295-308, May.
    15. Mans, Bernard & Mautor, Thierry & Roucairol, Catherine, 1995. "A parallel depth first search branch and bound algorithm for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 81(3), pages 617-628, March.
    16. Jerzy Grobelny & Rafal Michalski, 2016. "Experimental examination of facilities layout problems in logistics systems including objects with diverse sizes and shapes," WORking papers in Management Science (WORMS) WORMS/16/12, Department of Operations Research and Business Intelligence, Wroclaw University of Science and Technology.
    17. Kulturel-Konak, Sadan, 2012. "A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays," European Journal of Operational Research, Elsevier, vol. 223(3), pages 614-625.
    18. Miguel F. Anjos & Anthony Vannelli, 2006. "A New Mathematical-Programming Framework for Facility-Layout Design," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 111-118, February.
    19. Bock, Stefan & Hoberg, Kai, 2007. "Detailed layout planning for irregularly-shaped machines with transportation path design," European Journal of Operational Research, Elsevier, vol. 177(2), pages 693-718, March.
    20. Gonçalves, José Fernando & Resende, Mauricio G.C., 2015. "A biased random-key genetic algorithm for the unequal area facility layout problem," European Journal of Operational Research, Elsevier, vol. 246(1), pages 86-107.

    More about this item

    Keywords

    Facility layout; Binary; Linear Programming; Optimization; Efficiency;
    All these keywords.

    JEL classification:

    • C60 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - General
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    Statistics

    Access and download statistics

    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:hhs:uunewp:1999_013. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Ulrika Öjdeby (email available below). General contact details of provider: https://edirc.repec.org/data/nekuuse.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.