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

Joint optimisation for dynamic flexible job-shop scheduling problem with transportation time and resource constraints

Author

Listed:
  • Weibo Ren
  • Yan Yan
  • Yaoguang Hu
  • Yu Guan

Abstract

Dynamic flexible job-shop scheduling is traditionally a challenge in real-world manufacturing systems, especially considering the constraints of transportation resources and transportation time. To address the dynamic optimisation problem in flexible manufacturing systems, this paper proposes a novel proactive-reactive methodology to adapt to the dynamic changes in working environments and addresses the joint scheduling problem for machine tools and transportation resources. The joint optimisation model is first formulated as a mixed-integer programming model considering production efficiency and transportation constraints. The flowchart of the dynamic scheduling system is then designed for dynamic decision-making, and a novel particle swarm optimisation algorithm integrated with genetic operators is developed to respond to dynamic events and generate the reschedule plan in time. Finally, several numerical experiments and case studies in reality are applied to verify the efficiency of the developed methodology. Common dispatching rules and heuristic methods are also applied to test and evaluate the efficiency of the developed algorithm. Computational results demonstrate that the developed methods and decision models are efficient for dynamic job-shop scheduling problems in flexible manufacturing systems, which can acquire rather a good effect in practical production.

Suggested Citation

  • Weibo Ren & Yan Yan & Yaoguang Hu & Yu Guan, 2022. "Joint optimisation for dynamic flexible job-shop scheduling problem with transportation time and resource constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 60(18), pages 5675-5696, September.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:18:p:5675-5696
    DOI: 10.1080/00207543.2021.1968526
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2021.1968526?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:18:p:5675-5696. 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.