EUVIMEDOpdag EUVIMED
Open access · CC BY 4.0

An Efficient Job Insertion Algorithm for Hybrid Human–Machine Collaborative Flexible Job Shop Scheduling with Random Job Arrivals

Jiaye Song, Yiping Shen, Liping Wang, Changchun Liu, Dunbing Tang, Qingwei Nie

Electronics · 2025-08-26 · 14 (17) · 3397

DOI: 10.3390/electronics14173397 ↗

At a glance

Journal article in Electronics, published online on 2025-08-26. Written by Jiaye Song and 5 co-authors. Cited 6 times so far (Crossref); 38 references. The full text is freely available (open access, CC BY 4.0). Funded by: National Key Research and Development Program of China, National Natural Science Foundation of China, Natural Science Foundation of Jiangsu Province.

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

Human–machine collaborative scheduling has been widely applied in the modern manufacturing industry. Traditional scheduling algorithms often rely on frequent rescheduling when new jobs arrive, resulting in low responsiveness and difficulty in meeting the demands of high-paced production scenarios. Aiming at the hybrid human–machine collaborative flexible job shop scheduling problem (HHCFJSP) with random job arrivals, this paper proposes a hybrid algorithm based on improved job insertion strategy (HAIJI) dedicated to coping with sudden job insertion demands during the scheduling process. The algorithm constructs a two-dimensional evaluation vector based on minimum scheduling delay and residual scheduling flexibility to jointly assess potential insertion positions for each operation. A non-dominated sorting mechanism is employed to identify a set of promising insertion candidates, which are further evaluated using a tailored evaluation function. During the construction of the insertion plan, an A*-inspired greedy search strategy is adopted to guide the search process, followed by a backtracking mechanism to recover the globally optimal insertion sequence. Finally, the proposed algorithm is applied to the pre-scheduling phase and the dynamic rescheduling phase of a hybrid human–machine collaborative flexible job shop. Experimental results demonstrate that the proposed method achieves higher scheduling efficiency and stability in both stages and outperforms benchmark algorithms in terms of makespan and response time.

Funding

  • National Key Research and Development Program of China
  • National Natural Science Foundation of China
  • Natural Science Foundation of Jiangsu Province

Cite

APA

Song, J., Shen, Y., Wang, L., Liu, C., Tang, D., & Nie, Q. (2025). An Efficient Job Insertion Algorithm for Hybrid Human–Machine Collaborative Flexible Job Shop Scheduling with Random Job Arrivals. Electronics, 14(17), 3397. https://doi.org/10.3390/electronics14173397

Vancouver

Song J, Shen Y, Wang L, Liu C, Tang D, Nie Q. An Efficient Job Insertion Algorithm for Hybrid Human–Machine Collaborative Flexible Job Shop Scheduling with Random Job Arrivals. Electronics. 2025;14(17):3397. doi:10.3390/electronics14173397

BibTeX
@article{Song2025,
  author = {Song, Jiaye and Shen, Yiping and Wang, Liping and Liu, Changchun and Tang, Dunbing and Nie, Qingwei},
  title = {An Efficient Job Insertion Algorithm for Hybrid Human–Machine Collaborative Flexible Job Shop Scheduling with Random Job Arrivals},
  journal = {Electronics},
  year = {2025},
  volume = {14},
  number = {17},
  pages = {3397},
  doi = {10.3390/electronics14173397}
}
Start for free →