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

Multi-objective optimization of production system with staggered production

Author

Listed:
  • Chia-Huang Wu
  • Dong-Yuh Yang
  • Chung-Ling Huang

Abstract

In the manufacturing industry, timely order fulfilment from diverse customers is important for operational profitability, given the constraints of limited production capacity. This paper proposes a novel queueing system for a production system, in which order processing times are categorised as regular or rush based on customer preference. The proposed queueing system employs variable service rates and service strategies in conjunction with staggered production to deal with heterogeneous arrivals. We compute the steady-state probability distribution and develop system performance indicators. The lower and upper bounds of the expected sojourn time for rush and regular orders are derived. Numerical results show that an appropriate switching policy can reduce rush orders by approximately 35% while regular orders increase by less than 10%, demonstrating significant improvement in order fulfilment management. We formulate a multi-objective optimisation problem and implement the NSGA-II algorithm to obtain Pareto optimal solutions. Finally, three regression models are proposed to determine the minimum cost and the associated optimal service rates, given the maximum acceptable value of the expected number of rush orders. The established models can explain at least 80% of the dataset of the optimal solutions and thus our numerical findings provide useful guidance for decision-makers and production managers.

Suggested Citation

  • Chia-Huang Wu & Dong-Yuh Yang & Chung-Ling Huang, 2024. "Multi-objective optimization of production system with staggered production," International Journal of Production Research, Taylor & Francis Journals, vol. 62(23), pages 8276-8298, December.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:23:p:8276-8298
    DOI: 10.1080/00207543.2024.2337103
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2024.2337103?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:62:y:2024:i:23:p:8276-8298. 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.