Evidence map›Paper›PMID 40594155›Full record

ArticleScientific reports2025

A multi objective collaborative reinforcement learning algorithm for flexible job shop scheduling.

Jian Li, Shifa Li, Pengbo He, Huankun Li

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Jian LiSchool of Mechatronics Engineering, Henan University of Science and Technology, Luoyang, 471000, China. li_jian@haust.edu.cn.
Shifa Li *School of Mechatronics Engineering, Henan University of Science and Technology, Luoyang, 471000, China.
Pengbo He *School of Mechatronics Engineering, Henan University of Science and Technology, Luoyang, 471000, China.
Huankun Li *School of Mechatronics Engineering, Henan University of Science and Technology, Luoyang, 471000, China.

Funding

National Key Research and Development Program of China No.2023YFB4605100Science and Technology Research Program of He'nan Province 212102210356
6 · The paper itself

Abstract

To improve the scheduling efficiency of flexible job shops, this paper proposes a multi-objective collaborative intelligent agent reinforcement learning algorithm based on weight distribution. First, a mathematical model for flexible job shop scheduling optimization is established, with the makespan and total energy consumption of the shop as optimization objectives, and a disjunctive-graph is introduced to represent state features. Second, two intelligent agents are designed to address the simultaneous decision making problems of jobs and machines. Encoder-decoder components are implemented to facilitate state recognition and action output by the agents. Reward parameters are computed based on temporal differences at various moments, constructing a multi-objective Markov decision-process training model. Using hypervolume, set coverage and inverted generational distance as evaluation metrics, the algorithm is compared with those proposed in other studies on standard instances. The results demonstrate that the proposed method significantly outperforms other algorithms in solving the flexible job shop scheduling problem. Finally, a real-world case study further validates the effectiveness and practicality of the proposed algorithm.

Indexed as

Collaborative agent reinforcement learningFlexible job shop scheduling problemMarkov decision process

Identifiers

PMID40594155
PMCPMC12215729

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.