IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v338y2024i2d10.1007_s10479-024-05983-w.html
   My bibliography  Save this article

Joint decision-making for divisional seru scheduling and worker assignment considering process sequence constraints

Author

Listed:
  • Lili Wang

    (Nanjing University)

  • Min Li

    (Nanjing University
    Civil Aviation Flight University of China)

  • Guanbin Kong

    (Nanjing University)

  • Haiwen Xu

    (Civil Aviation Flight University of China)

Abstract

This paper concentrates on the divisional seru scheduling and worker assignment joint decision-making problem, and synthetically considers the difference in workers’ skill sets, the diversity of workers’ skill levels, the process sequence constraints, setup time, lot-splitting, etc., and then a nonlinear integer programming model is constructed to minimize the makespan. We show that it is necessary to consider the process sequence constraints, and the optimal makespan of the worker-operation allocation scheme without considering the process sequence constraints is much larger than that of considering the process sequence constraints. Moreover, as the number of workers increases, the advantage of considering sequence constraints becomes more obvious. Considering the multi-decision attributes and intractable computations of the studied problem, we turn it into bi-level programming. Then based on the combination of a hybrid genetic variable neighbourhood search algorithm (HGVNSA) and a greedy heuristic algorithm (GHA), a bi-level nested heuristic algorithm (HGVNSA-GHA) is designed. Finally, numerical experiment results show that the proposed algorithm can achieve better results and higher efficiency for the divisional seru scheduling and worker assignment model.

Suggested Citation

  • Lili Wang & Min Li & Guanbin Kong & Haiwen Xu, 2024. "Joint decision-making for divisional seru scheduling and worker assignment considering process sequence constraints," Annals of Operations Research, Springer, vol. 338(2), pages 1157-1185, July.
    • Handle: RePEc:spr:annopr:v:338:y:2024:i:2:d:10.1007_s10479-024-05983-w
    DOI: 10.1007/s10479-024-05983-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-024-05983-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-024-05983-w?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.

    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:spr:annopr:v:338:y:2024:i:2:d:10.1007_s10479-024-05983-w. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.