A metaheuristic algorithm co-driven by Q-learning and a learning mechanism for the distributed blocking flowshop scheduling problem with preventive maintenance and sequence-dependent setup times
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Drawing inspiration from manufacturing production processes like chemical and steel manufacturing, the distributed blocking flowshop scheduling problem with preventive maintenance and sequence-dependent setup times (DBFSP/PM/SDST) is studied. First, it is described by a mixed-integer linear programming model with the objective of minimizing the total flowtime. Second, we propose a Q-learning and learning mechanism co-driven approach, integrating it into the discrete grey wolf optimization algorithm (DGWO_Q). In the algorithm, the neighborhood search structure is adjusted using Q-learning based on dynamic feedback from the environment. The balance between exploration and exploitation can be improved by introducing learning mechanisms in the search phase that can guide the grey wolf as it approaches the prey. Furthermore, a differential hunting strategy is designed to prevent the algorithm from falling into local optima. Third, a heuristic that enhances the quality of the initial solution is proposed for the problem characteristics. Finally, the proposed DGWO_Q is compared with four conventional efficient algorithms in numerical experiments on 225 instances of different sizes. Experimental results show that the DGWO_Q algorithm demonstrates excellent performance across test cases of various scales, effectively reducing production cycle time, setup times and the impact of maintenance downtime on production efficiency. It provides an efficient intelligent optimization approach for solving the complex scheduling problem.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it