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

Simultaneous machine selection and buffer allocation in large unbalanced series-parallel production lines

Author

Listed:
  • Shaohui Xi
  • James MacGregor Smith
  • Qingxin Chen
  • Ning Mao
  • Huiyu Zhang
  • Ailin Yu

Abstract

Simultaneous optimisation of machines and buffers in a large series-parallel production line is an NP-hard problem. The formulated optimisation model in this study is used to minimise the total investment cost subject to the desired throughput rate and cycle time by optimising the machine types, number of parallel machines, and buffer capacities. To solve this kind of design problem, a decomposition-coordination method is proposed to efficiently and accurately generate allocation solutions for large production lines. The proposed method includes two iterative processes: the decomposition process decouples the original line into several small lines and optimises them separately, while the coordination process ensures that the optimisation problems of the decomposed lines are similar to the corresponding part of the original. The performance of this approach is demonstrated through numerical experiments by comparisons with the simulated annealing algorithm and non-dominated sorting genetic algorithm-II. Finally, the sets of numerical results and a multi-factorial experimental analysis illustrate the influences of target system parameters on the resource configurations.

Suggested Citation

  • Shaohui Xi & James MacGregor Smith & Qingxin Chen & Ning Mao & Huiyu Zhang & Ailin Yu, 2022. "Simultaneous machine selection and buffer allocation in large unbalanced series-parallel production lines," International Journal of Production Research, Taylor & Francis Journals, vol. 60(7), pages 2103-2125, April.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:7:p:2103-2125
    DOI: 10.1080/00207543.2021.1884306
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1884306
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2021.1884306?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:60:y:2022:i:7:p:2103-2125. 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.