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

Production coordination of local and cloud orders in shared manufacturing: a bi-objective pre-scheduling approach

Author

Listed:
  • Weidong Lei

    (Xi’an University of Science and Technology)

  • Liu Yang

    (University of Electronic Science and Technology of China)

  • Pengyu Yan

    (University of Electronic Science and Technology of China)

  • Chengbin Chu

    (University Gustave Eiffel, ESIEE Paris, COSYS-GRETTIA)

  • Jie Yang

    (University of Electronic Science and Technology of China)

Abstract

This paper presents a bi-objective solution approach to address the production scheduling challenge encountered by manufacturers in a shared manufacturing environment. In such scenarios, manufacturers are required to manage orders received through a cloud platform (referred to as cloud orders) while simultaneously fulfilling orders from their long-term and regular clients (local orders). The problem is to efficiently coordinate the production of both types of orders within shared manufacturing facilities. We formulate the problem into a bi-objective mixed integer programming model aimed at simultaneously minimizing the delivery time of cloud orders and mitigating the disruptions to local order production caused by cloud orders. This solution approach comprises three key components: computation of cloud orders’ starting times, construction of available time intervals of manufacturing facilities, and a bi-objective heuristic. This heuristic combines an enhanced hybrid discrete differential evolution with a modified forward–backward earliest starting time algorithm. We introduce an advanced population initialization technique, a novel individual update strategy, and an adaptive local search mechanism based on Pareto-dominance principles to improve the search capabilities of the algorithm towards discovering Pareto non-dominated solutions. Computational results show that the proposed approach outperforms the existing algorithm in most test instances in terms of five common metrics. Insights are discussed, highlighting the practical implications and potential benefits of the proposed approach for shared manufacturing scheduling.

Suggested Citation

  • Weidong Lei & Liu Yang & Pengyu Yan & Chengbin Chu & Jie Yang, 2025. "Production coordination of local and cloud orders in shared manufacturing: a bi-objective pre-scheduling approach," Annals of Operations Research, Springer, vol. 345(1), pages 207-245, February.
  • Handle: RePEc:spr:annopr:v:345:y:2025:i:1:d:10.1007_s10479-024-06380-z
    DOI: 10.1007/s10479-024-06380-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-024-06380-z
    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-06380-z?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.

    References listed on IDEAS

    as
    1. Félix Quinton & Idir Hamaz & Laurent Houssin, 2020. "A mixed integer linear programming modelling for the flexible cyclic jobshop problem," Annals of Operations Research, Springer, vol. 285(1), pages 335-352, February.
    2. SubaI, Corinne & Baptiste, Pierre & Niel, Eric, 2006. "Scheduling issues for environmentally responsible manufacturing: The case of hoist scheduling in an electroplating line," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 74-87, February.
    3. Carolina Saavedra Sueldo & Ivo Perez Colo & Mariano De Paula & Sebastián A. Villar & Gerardo G. Acosta, 2023. "ROS-based architecture for fast digital twin development of smart manufacturing robotized systems," Annals of Operations Research, Springer, vol. 322(1), pages 75-99, March.
    4. Vladimir Kats & Eugene Levner, 1997. "Minimizing the number of robots to meet a given cyclic schedule," Annals of Operations Research, Springer, vol. 69(0), pages 209-226, January.
    5. Yang-Kuei Lin & Chin Soon Chong, 2017. "Fast GA-based project scheduling for computing resources allocation in a cloud manufacturing system," Journal of Intelligent Manufacturing, Springer, vol. 28(5), pages 1189-1201, June.
    6. Y. Crama & V. Kats & J. van de Klundert & E. Levner, 2000. "Cyclic scheduling in robotic flowshops," Annals of Operations Research, Springer, vol. 96(1), pages 97-124, November.
    7. Chauvet, Fabrice & Levner, Eugene & Meyzin, Leonid K. & Proth, Jean-Marie, 2000. "On-line scheduling in a surface treatment system," European Journal of Operational Research, Elsevier, vol. 120(2), pages 382-392, January.
    8. Weidong Lei & Ada Che & Chengbin Chu, 2014. "Optimal cyclic scheduling of a robotic flowshop with multiple part types and flexible processing times," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 8(2), pages 143-167.
    9. Che, Ada & Kats, Vladimir & Levner, Eugene, 2017. "An efficient bicriteria algorithm for stable robotic flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 260(3), pages 964-971.
    10. Wu, Xueqi & Che, Ada, 2019. "A memetic differential evolution algorithm for energy-efficient parallel machine scheduling," Omega, Elsevier, vol. 82(C), pages 155-165.
    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. Feng, Jianguang & Che, Ada & Chu, Chengbin & Levner, Eugene & Kats, Vladimir, 2024. "Scheduling robotic cells with fixed processing times or time windows: Classification, solution approaches, polynomial algorithms and complexity," European Journal of Operational Research, Elsevier, vol. 319(2), pages 468-483.
    2. Che, Ada & Chabrol, Michelle & Gourgand, Michel & Wang, Yuan, 2012. "Scheduling multiple robots in a no-wait re-entrant robotic flowshop," International Journal of Production Economics, Elsevier, vol. 135(1), pages 199-208.
    3. Sun, Yige & Chung, Sai-Ho & Wen, Xin & Ma, Hoi-Lam, 2021. "Novel robotic job-shop scheduling models with deadlock and robot movement considerations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    4. Che, Ada & Chu, Chengbin, 2009. "Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots," European Journal of Operational Research, Elsevier, vol. 199(1), pages 77-88, November.
    5. Janny M. Y. Leung & Guoqing Zhang & Xiaoguang Yang & Raymond Mak & Kokin Lam, 2004. "Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach," Operations Research, INFORMS, vol. 52(6), pages 965-976, December.
    6. Yamashiro, Hirochika & Nonaka, Hirofumi, 2021. "Estimation of processing time using machine learning and real factory data for optimization of parallel machine scheduling problem," Operations Research Perspectives, Elsevier, vol. 8(C).
    7. Kan Fang & Nelson Uhan & Fu Zhao & John Sutherland, 2016. "Scheduling on a single machine under time-of-use electricity tariffs," Annals of Operations Research, Springer, vol. 238(1), pages 199-227, March.
    8. Lin, Hung-Tso & Lee, Hong-Tau & Pan, Wen-Jung, 2008. "Heuristics for scheduling in a no-wait open shop with movable dedicated machines," International Journal of Production Economics, Elsevier, vol. 111(2), pages 368-377, February.
    9. Paul, Henrik J. & Bierwirth, Christian & Kopfer, Herbert, 2007. "A heuristic scheduling procedure for multi-item hoist production lines," International Journal of Production Economics, Elsevier, vol. 105(1), pages 54-69, January.
    10. Kats, Vladimir & Lei, Lei & Levner, Eugene, 2008. "Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1196-1211, June.
    11. Sofie Coene & Frits C. R. Spieksma & Gerhard J. Woeginger, 2011. "Charlemagne's Challenge: The Periodic Latency Problem," Operations Research, INFORMS, vol. 59(3), pages 674-683, June.
    12. Delorme, Xavier & Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y., 2019. "Minimizing the number of workers in a paced mixed-model assembly line," European Journal of Operational Research, Elsevier, vol. 272(1), pages 188-194.
    13. Ye Wang & Jiafu Tang, 2022. "Optimized skill configuration for the seru production system under an uncertain demand," Annals of Operations Research, Springer, vol. 316(1), pages 445-465, September.
    14. Jiyin Liu & Yun Jiang, 2005. "An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem," Operations Research, INFORMS, vol. 53(2), pages 313-327, April.
    15. Liu, Ying & Dong, Haibo & Lohse, Niels & Petrovic, Sanja, 2016. "A multi-objective genetic algorithm for optimisation of energy consumption and shop floor production performance," International Journal of Production Economics, Elsevier, vol. 179(C), pages 259-272.
    16. Drobouchevitch, Inna G. & Sethi, Suresh P. & Sriskandarajah, Chelliah, 2006. "Scheduling dual gripper robotic cell: One-unit cycles," European Journal of Operational Research, Elsevier, vol. 171(2), pages 598-631, June.
    17. Vladimir G. Deineko & George Steiner & Zhihui Xue, 2005. "Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices," Journal of Combinatorial Optimization, Springer, vol. 9(4), pages 381-399, June.
    18. Chelliah Sriskandarajah & Inna Drobouchevitch & Suresh P. Sethi & Ramaswamy Chandrasekaran, 2004. "Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot," Operations Research, INFORMS, vol. 52(1), pages 65-82, February.
    19. Wu, Xueqi & Che, Ada, 2020. "Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search," Omega, Elsevier, vol. 94(C).
    20. Hurink, Johann & Knust, Sigrid, 2005. "Tabu search algorithms for job-shop problems with a single transport robot," European Journal of Operational Research, Elsevier, vol. 162(1), pages 99-111, April.

    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:345:y:2025:i:1:d:10.1007_s10479-024-06380-z. 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: 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.