IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v59y2021i17p5216-5235.html
   My bibliography  Save this article

The aperiodic facility layout problem with time-varying demands and an optimal master-slave solution approach

Author

Listed:
  • Yiyong Xiao
  • Yue Zhang
  • Sadan Kulturel-Konak
  • Abdullah Konak
  • Yuchun Xu
  • Shenghan Zhou

Abstract

In many seasonal industries, customer demands are constantly changing over time, and accordingly the facility layout should be re-optimized in a timely manner to adapt to changing material handling patterns among manufacturing departments. This paper investigates the aperiodic facility layout problem (AFLP) that involves arranging facilities layout and re-layout aperiodically in a dynamic manufacturing environment during a given planning horizon. The AFLP is decomposed into a master problem and a combination set of static facility layout problems (FLPs, the slave problems) without loss of optimality, and all problems are formulated as mixed-integer linear programming (MILP) models that can be solved by MIP solvers for small-sized problems. An exact backward dynamic programming (BDP) algorithm with a computational complexity of O(n2) is developed for the master problem, and an improved linear programming based problem evolution algorithm (PEA-LP) is developed for the traditional static FLP. Computational experiments are conducted on two new problems and twelve well-known benchmark problems from the literature, and the experimental results show that the proposed solution approach is promising for solving the AFLP with practical sizes of problem instances. In addition, the improved PEA-LP found new best solutions for five benchmark problems.

Suggested Citation

  • Yiyong Xiao & Yue Zhang & Sadan Kulturel-Konak & Abdullah Konak & Yuchun Xu & Shenghan Zhou, 2021. "The aperiodic facility layout problem with time-varying demands and an optimal master-slave solution approach," International Journal of Production Research, Taylor & Francis Journals, vol. 59(17), pages 5216-5235, September.
    • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:17:p:5216-5235
    DOI: 10.1080/00207543.2020.1775909
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2020.1775909
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2020.1775909?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.

    More about this item

    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:taf:tprsxx:v:59:y:2021:i:17:p:5216-5235. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.