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

An effective heuristic based on 3-opt strategy for seru scheduling problems with learning effect

Author

Listed:
  • Zhe Zhang
  • Xiaoling Song
  • Xue Gong
  • Yong Yin
  • Benjamin Lev
  • Xiaoyang Zhou

Abstract

This paper is concerned with the scheduling problem in a new-type seru production system by consideration of DeJong's learning effect to minimise the total weighted completion time, so as to achieve efficiency, flexibility, and fast responsiveness to cope with the current volatile market. A combinatorial optimisation model is constructed and then reformulated to a binary quadratic assignment program. Accordingly, after presenting the necessary and sufficient condition for the locally optimal solution, a tabu search with strategic oscillation based on 3-opt as a diversification strategy is designed as the solution approach. A set of test problems are generated, and computational experiments with large-scale cases are made finally. The results indicate that the proposed heuristic algorithm is promising in solving seru scheduling problems and has a good performance in term of solution quality, efficiency, and scalability.

Suggested Citation

  • Zhe Zhang & Xiaoling Song & Xue Gong & Yong Yin & Benjamin Lev & Xiaoyang Zhou, 2023. "An effective heuristic based on 3-opt strategy for seru scheduling problems with learning effect," International Journal of Production Research, Taylor & Francis Journals, vol. 61(6), pages 1938-1954, March.
    • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:6:p:1938-1954
    DOI: 10.1080/00207543.2022.2054744
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2054744
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2022.2054744?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:61:y:2023:i:6:p:1938-1954. 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.