Peng Liu^1,*, Ke Xu^1,2, Hua Gong^1,2

CMC-Computers, Materials & Continua, Vol.76, No.1, pp. 239-258, 2023, DOI:10.32604/cmc.2023.038232 - 08 June 2023

Abstract Given the challenges of manufacturing resource sharing and competition in the modern manufacturing industry, the coordinated scheduling problem of parallel machine production and transportation is investigated. The problem takes into account the coordination of production and transportation before production as well as the disparities in machine spatial position and performance. A non-cooperative game model is established, considering the competition and self-interest behavior of jobs from different customers for machine resources. The job from different customers is mapped to the players in the game model, the corresponding optional processing machine and location are mapped to the… More >

Caiyun Liu, Peng Liu^*

Intelligent Automation & Soft Computing, Vol.36, No.3, pp. 3221-3242, 2023, DOI:10.32604/iasc.2023.035114 - 15 March 2023

Abstract Shared manufacturing is recognized as a new point-to-point manufacturing mode in the digital era. Shared manufacturing is referred to as a new manufacturing mode to realize the dynamic allocation of manufacturing tasks and resources. Compared with the traditional mode, shared manufacturing offers more abundant manufacturing resources and flexible configuration options. This paper proposes a model based on the description of the dynamic allocation of tasks and resources in the shared manufacturing environment, and the characteristics of shared manufacturing resource allocation. The execution of manufacturing tasks, in which candidate manufacturing resources enter or exit at various More >

Qi Wei^*, Yong Wu

CMES-Computer Modeling in Engineering & Sciences, Vol.131, No.2, pp. 1125-1146, 2022, DOI:10.32604/cmes.2022.019754 - 14 March 2022

Abstract In the “shared manufacturing” environment, based on fairness, shared manufacturing platforms often require manufacturing service enterprises to arrange production according to the principle of “order first, finish first” which leads to a series of scheduling problems with fixed processing sequences. In this paper, two two-machine hybrid flow-shop problems with fixed processing sequences are studied. Each job has two tasks. The first task is flexible, which can be processed on either of the two machines, and the second task must be processed on the second machine after the first task is completed. We consider two objective… More >