IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v259y2017i2p538-553.html
   My bibliography  Save this article

Dynamic facility layout problem based on open queuing network theory

Author

Listed:
  • Pourvaziri, Hani
  • Pierreval, Henri

Abstract

Determining the location of machines for given periods of time, depending on changes in the material flow between the machines, is known in the literature as a dynamic facility layout problem (DFLP). While most approaches focus on reducing handling and rearrangement costs, this article also considers the amount of work-in-process (WIP) for a particular class of problems. WIP results from the queuing phenomenon and depends on the availability of transportation units. To solve these types of problems, we suggest the use of an analytical approach which uses open queuing network theory and is based on a quadratic assignment problem formulation. Since a queuing model approximates the studied system, the accuracy of the results is evaluated through a comparison with simulation results. Considering both the NP-hardness and the multi-objective nature of the problem, a meta-heuristic optimization approach is proposed. It aims at determining the Pareto front using cloud-based multi-objective simulated annealing (C-MOSA). The performance of C-MOSA is evaluated against other published multi-objective approaches. Computational experiments are performed and the results show that C-MOSA is capable of obtaining efficient results to solve the multi-objective dynamic facility layout problem.

Suggested Citation

  • Pourvaziri, Hani & Pierreval, Henri, 2017. "Dynamic facility layout problem based on open queuing network theory," European Journal of Operational Research, Elsevier, vol. 259(2), pages 538-553.
    • Handle: RePEc:eee:ejores:v:259:y:2017:i:2:p:538-553
    DOI: 10.1016/j.ejor.2016.11.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716309171
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.11.011?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.
    2. Allahverdi, Ali & Aydilek, Harun, 2014. "Total completion time with makespan constraint in no-wait flowshops with setup times," European Journal of Operational Research, Elsevier, vol. 238(3), pages 724-734.
    3. Vishwanath Ramabhatta & Rakesh Nagi, 1998. "An integrated formulation of manufacturing cell formation with capacity planning and multiple routings," Annals of Operations Research, Springer, vol. 77(0), pages 79-95, January.
    4. Wu, Kan & McGinnis, Leon, 2012. "Performance evaluation for general queueing networks in manufacturing systems: Characterizing the trade-off between queue time and utilization," European Journal of Operational Research, Elsevier, vol. 221(2), pages 328-339.
    5. Subba Rao, S. & Gunasekaran, A. & Goyal, S. K. & Martikainen, T., 1998. "Waiting line model applications in manufacturing," International Journal of Production Economics, Elsevier, vol. 54(1), pages 1-28, January.
    6. McKendall Jr., Alan R. & Hakobyan, Artak, 2010. "Heuristics for the dynamic facility layout problem with unequal-area departments," European Journal of Operational Research, Elsevier, vol. 201(1), pages 171-182, February.
    7. Yang, Taho & Fu, Hsin-Pin & Yang, Kuang-Yi, 2007. "An evolutionary-simulation approach for the optimization of multi-constant work-in-process strategy--A case study," International Journal of Production Economics, Elsevier, vol. 107(1), pages 104-114, May.
    8. Saifallah Benjaafar, 2002. "Modeling and Analysis of Congestion in the Design of Facility Layouts," Management Science, INFORMS, vol. 48(5), pages 679-704, May.
    9. Kerbache, Laoucine & Smith, J. MacGregor, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," European Journal of Operational Research, Elsevier, vol. 121(1), pages 105-123, February.
    10. Souza, Gilvan C. & Wagner, Harvey M. & Whybark, D. Clay, 2001. "Evaluating focused factory benefits with queuing theory," European Journal of Operational Research, Elsevier, vol. 128(3), pages 597-610, February.
    11. Yao, David D. W. & Buzacott, J. A., 1985. "Queueing models for a flexible machining station Part II: The method of Coxian phases," European Journal of Operational Research, Elsevier, vol. 19(2), pages 241-252, February.
    12. Askin, Ronald G. & Mitwasi, M. George, 1992. "Integrating facility layout with process selection and capacity planning," European Journal of Operational Research, Elsevier, vol. 57(2), pages 162-173, March.
    13. Hirotaka Sakasegawa, 1977. "An approximation formulaL q ≃α·ρ β /(1-ρ)," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 29(1), pages 67-75, December.
    14. Slotnick, Susan A., 2011. "Optimal and heuristic lead-time quotation for an integrated steel mill with a minimum batch size," European Journal of Operational Research, Elsevier, vol. 210(3), pages 527-536, May.
    15. Laoucine Kerbache & J. Macgregor Smith, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," Post-Print hal-00798811, HAL.
    16. Azadeh, A. & Moghaddam, M. & Asadzadeh, S.M. & Negahban, A., 2011. "An integrated fuzzy simulation-fuzzy data envelopment analysis algorithm for job-shop layout optimization: The case of injection process with ambiguous data," European Journal of Operational Research, Elsevier, vol. 214(3), pages 768-779, November.
    17. Les Foulds & Fariborz Partovi, 1998. "Integrating the analytic hierarchy process andgraph theory to model facilities layout," Annals of Operations Research, Springer, vol. 82(0), pages 219-232, August.
    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. Pablo Pérez-Gosende & Josefa Mula & Manuel Díaz-Madroñero, 2020. "Overview of Dynamic Facility Layout Planning as a Sustainability Strategy," Sustainability, MDPI, vol. 12(19), pages 1-16, October.
    2. J.I. Guerrero & Enrique Personal & Antonio García & Antonio Parejo & Francisco Pérez & Carlos León, 2019. "Distributed Charging Prioritization Methodology Based on Evolutionary Computation and Virtual Power Plants to Integrate Electric Vehicle Fleets on Smart Grids," Energies, MDPI, vol. 12(12), pages 1-22, June.
    3. Simge Yelkenci Kose & Ozcan Kilincci, 2020. "A multi-objective hybrid evolutionary approach for buffer allocation in open serial production lines," Journal of Intelligent Manufacturing, Springer, vol. 31(1), pages 33-51, January.

    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. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    2. Kerbache, Laoucine & MacGregor Smith, James, 2004. "Queueing networks and the topological design of supply chain systems," International Journal of Production Economics, Elsevier, vol. 91(3), pages 251-272, October.
    3. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    4. Chen, Shih-Pin, 2004. "Parametric nonlinear programming for analyzing fuzzy queues with finite capacity," European Journal of Operational Research, Elsevier, vol. 157(2), pages 429-438, September.
    5. Wu, Kan & McGinnis, Leon, 2012. "Performance evaluation for general queueing networks in manufacturing systems: Characterizing the trade-off between queue time and utilization," European Journal of Operational Research, Elsevier, vol. 221(2), pages 328-339.
    6. Chen, Shih-Pin, 2007. "Solving fuzzy queueing decision problems via a parametric mixed integer nonlinear programming method," European Journal of Operational Research, Elsevier, vol. 177(1), pages 445-457, February.
    7. Hui-Yu Zhang & Qing-Xin Chen & James MacGregor Smith & Ning Mao & Ai-Lin Yu & Zhan-Tao Li, 2017. "Performance analysis of open general queuing networks with blocking and feedback," International Journal of Production Research, Taylor & Francis Journals, vol. 55(19), pages 5760-5781, October.
    8. Osorio, Carolina & Wang, Carter, 2017. "On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 305-339.
    9. Osorio, Carolina & Bierlaire, Michel, 2009. "An analytic finite capacity queueing network model capturing the propagation of congestion and blocking," European Journal of Operational Research, Elsevier, vol. 196(3), pages 996-1007, August.
    10. Hughes, Michael S. & Lunday, Brian J. & Weir, Jeffrey D. & Hopkinson, Kenneth M., 2021. "The multiple shortest path problem with path deconfliction," European Journal of Operational Research, Elsevier, vol. 292(3), pages 818-829.
    11. Andreas Hottenrott & Martin Grunow, 2019. "Flexible layouts for the mixed-model assembly of heterogeneous vehicles," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 943-979, December.
    12. Stepanov, Alexander & Smith, James MacGregor, 2009. "Multi-objective evacuation routing in transportation networks," European Journal of Operational Research, Elsevier, vol. 198(2), pages 435-446, October.
    13. Osorio, Carolina & Bierlaire, Michel, 2012. "A tractable analytical model for large-scale congested protein synthesis networks," European Journal of Operational Research, Elsevier, vol. 219(3), pages 588-597.
    14. Geng, Sunyue & Liu, Sifeng & Fang, Zhigeng, 2022. "An agent-based algorithm for dynamic routing in service networks," European Journal of Operational Research, Elsevier, vol. 303(2), pages 719-734.
    15. Wu, Kan, 2014. "Taxonomy of batch queueing models in manufacturing systems," European Journal of Operational Research, Elsevier, vol. 237(1), pages 129-135.
    16. Cruz, F.R.B. & van Woensel, T. & MacGregor Smith, J. & Lieckens, K., 2010. "On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks," European Journal of Operational Research, Elsevier, vol. 201(1), pages 183-193, February.
    17. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Modelling complex assemblies as a queueing network for lead time control," European Journal of Operational Research, Elsevier, vol. 174(1), pages 150-168, October.
    18. Tancrez, Jean-Sbastien & Semal, Pierre & Chevalier, Philippe, 2009. "Histogram based bounds and approximations for production lines," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1133-1141, September.
    19. Yunyue He & Zhong Liu & Jianmai Shi & Yishan Wang & Jiaming Zhang & Jinyuan Liu, 2015. "K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    20. Osorio, Carolina & Flötteröd, Gunnar & Bierlaire, Michel, 2011. "Dynamic network loading: A stochastic differentiable model that derives link state distributions," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1410-1423.

    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:259:y:2017:i:2:p:538-553. 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: 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.

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