IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v324y2025i1p62-74.html
   My bibliography  Save this article

Dynamic worker allocation in Seru production systems with actor–critic and pointer networks

Author

Listed:
  • Li, Dongni
  • Jin, Hongbo
  • Zhang, Yaoxin

Abstract

Following the rapid evolution of manufacturing industries, customer demands may change dramatically, which challenges the conventional production systems. Seru production system (SPS) is a key to deal with uncertain varieties and fluctuating volumes. In dynamic scenarios, orders with uncertain demands arrive over time. For each arriving order, appropriate workers should be allocated to assemble it. This study investigates the dynamic worker allocation problem with the objective of maximizing the revenue obtained by the SPS. To tackle this problem, a novel algorithm that integrates actor–critic and pointer networks is proposed. The global-and-local attention mechanism and twin focus encoders are particularly designed to address the dynamic and uncertain properties of the problem. The algorithm is compared to three approaches, including the standard actor–critic algorithm, proximal policy optimization algorithm, and the approximation algorithm with the best approximation ratio, in different scenarios, i.e., small, medium, and large factories. The proposed algorithm outperforms the standard actor–critic approach and proximal policy optimization algorithm, showing performance gaps ranging from 7.23% to 37.44%. It also outperforms the approximation algorithm, with gaps between 56.73% and 96.94%. Numerical results of the three scenarios show that the proposed algorithm is more efficient and effective in handling uncertainty and dynamics, making it a promising solution for real-world manufacturing production systems.

Suggested Citation

  • Li, Dongni & Jin, Hongbo & Zhang, Yaoxin, 2025. "Dynamic worker allocation in Seru production systems with actor–critic and pointer networks," European Journal of Operational Research, Elsevier, vol. 324(1), pages 62-74.
  • Handle: RePEc:eee:ejores:v:324:y:2025:i:1:p:62-74
    DOI: 10.1016/j.ejor.2025.01.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725000372
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2025.01.012?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    2. Bengio, Yoshua & Lodi, Andrea & Prouvost, Antoine, 2021. "Machine learning for combinatorial optimization: A methodological tour d’horizon," European Journal of Operational Research, Elsevier, vol. 290(2), pages 405-421.
    3. John D. Mittelstaedt & George N. Harben & William A. Ward, 2003. "How Small Is Too Small? Firm Size as a Barrier to Exporting from the United States," Journal of Small Business Management, Taylor & Francis Journals, vol. 41(1), pages 68-84, January.
    4. Kathryn E. Stecke & Yong Yin & Ikou Kaku & Yasuhiko Murase, 2012. "Seru: The Organizational Extension of JIT for a Super-Talent Factory," International Journal of Strategic Decision Sciences (IJSDS), IGI Global Scientific Publishing, vol. 3(1), pages 106-119, January.
    5. Zhang, Zhe & Song, Xiaoling & Huang, Huijung & Zhou, Xiaoyang & Yin, Yong, 2022. "Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong’s learning effect," European Journal of Operational Research, Elsevier, vol. 297(3), pages 866-877.
    6. Carliss Y. Baldwin & Kim B. Clark, 2000. "Design Rules, Volume 1: The Power of Modularity," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262024667, December.
    7. Zhang, Zhe & Song, Xiaoling & Gong, Xue & Yin, Yong & Lev, Benjamin & Zhou, Xiaoyang, 2024. "Coordinated seru scheduling and distribution operation problems with DeJong’s learning effects," European Journal of Operational Research, Elsevier, vol. 313(2), pages 452-464.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. Li, Dongni & Jiang, Yuzhou & Zhang, Jinhui & Cui, Zihua & Yin, Yong, 2023. "An on-line seru scheduling algorithm with proactive waiting considering resource conflicts," European Journal of Operational Research, Elsevier, vol. 309(2), pages 506-515.
    3. Zhang, Zhe & Song, Xiaoling & Gong, Xue & Yin, Yong & Lev, Benjamin & Zhou, Xiaoyang, 2024. "Coordinated seru scheduling and distribution operation problems with DeJong’s learning effects," European Journal of Operational Research, Elsevier, vol. 313(2), pages 452-464.
    4. Zhe Zhang & Xiaoling Song & Huijun Huang & Yong Yin & Benjamin Lev, 2022. "Scheduling problem in seru production system considering DeJong’s learning effect and job splitting," Annals of Operations Research, Springer, vol. 312(2), pages 1119-1141, May.
    5. Zhang, Zhecong & Yu, Yang & Qi, Xuqiang & Lu, Yangguang & Li, Xiaolong & Kaku, Ikou, 2025. "Multi-objective cooperative co-evolution algorithm with hypervolume-based Q-learning for hybrid seru system," European Journal of Operational Research, Elsevier, vol. 324(3), pages 839-854.
    6. Zhang, Zhe & Gong, Xue & Song, Xiaoling & Yin, Yong & Lev, Benjamin & Chen, Jie, 2022. "A column generation-based exact solution method for seru scheduling problems," Omega, Elsevier, vol. 108(C).
    7. Cambier, Adrien & Chardy, Matthieu & Figueiredo, Rosa & Ouorou, Adam & Poss, Michael, 2022. "Optimizing subscriber migrations for a telecommunication operator in uncertain context," European Journal of Operational Research, Elsevier, vol. 298(1), pages 308-321.
    8. Baldwin, Carliss Y. & Bogers, Marcel L.A.M. & Kapoor, Rahul & West, Joel, 2024. "Focusing the ecosystem lens on innovation studies," Research Policy, Elsevier, vol. 53(3).
    9. Filippo Carlo Wezel & Gino Cattani & Johannes M. Pennings, 2006. "Competitive Implications of Interfirm Mobility," Organization Science, INFORMS, vol. 17(6), pages 691-709, December.
    10. Srivardhini K. Jha & E. Richard Gold & Laurette Dubé, 2021. "Modular Interorganizational Network Governance: A Conceptual Framework for Addressing Complex Social Problems," Sustainability, MDPI, vol. 13(18), pages 1-21, September.
    11. Sarhadi, Hassan & Naoum-Sawaya, Joe & Verma, Manish, 2020. "A robust optimization approach to locating and stockpiling marine oil-spill response facilities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    12. Jeong, Jaehee & Premsankar, Gopika & Ghaddar, Bissan & Tarkoma, Sasu, 2024. "A robust optimization approach for placement of applications in edge computing considering latency uncertainty," Omega, Elsevier, vol. 126(C).
    13. Baker, Erin & Bosetti, Valentina & Salo, Ahti, 2016. "Finding Common Ground when Experts Disagree: Belief Dominance over Portfolios of Alternatives," MITP: Mitigation, Innovation and Transformation Pathways 243147, Fondazione Eni Enrico Mattei (FEEM).
    14. Singh, Anuraag & Triulzi, Giorgio & Magee, Christopher L., 2021. "Technological improvement rate predictions for all technologies: Use of patent data and an extended domain description," Research Policy, Elsevier, vol. 50(9).
    15. Seppo Kuula & Harri Haapasalo & Arto Tolonen, 2018. "Cost-efficient co-creation of knowledge intensive business services," Service Business, Springer;Pan-Pacific Business Association, vol. 12(4), pages 779-808, December.
    16. Gambardella, Alfonso & Conti, Raffaele & Novelli, Elena, 2018. "Specializing in Generality: Firm Strategies When Intermediate Markets Work," CEPR Discussion Papers 12782, C.E.P.R. Discussion Papers.
    17. Morgan Dwyer & Bruce Cameron & Zoe Szajnfarber, 2015. "A Framework for Studying Cost Growth on Complex Acquisition Programs," Systems Engineering, John Wiley & Sons, vol. 18(6), pages 568-583, November.
    18. Fei Li & Jin Chen & Ying Ying, 2019. "Innovation Search Scope, Technological Complexity, and Environmental Turbulence: A N-K Simulation," Sustainability, MDPI, vol. 11(16), pages 1-12, August.
    19. Qiu, Ruozhen & Sun, Minghe & Lim, Yun Fong, 2017. "Optimizing (s, S) policies for multi-period inventory models with demand distribution uncertainty: Robust dynamic programing approaches," European Journal of Operational Research, Elsevier, vol. 261(3), pages 880-892.
    20. Bruce Fallick & Charles A. Fleischman & James B. Rebitzer, 2006. "Job-Hopping in Silicon Valley: Some Evidence Concerning the Microfoundations of a High-Technology Cluster," The Review of Economics and Statistics, MIT Press, vol. 88(3), pages 472-481, August.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:eee:ejores:v:324:y:2025:i:1:p:62-74. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.