A hybrid artificial bee colony algorithm with an iterated local search mechanism for distributed no-wait flowshop problems with preventive maintenance
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
In this paper, a distributed no-wait permutation flowshop scheduling problem with a preventive maintenance operation (PM/DNWPFSP) is investigated. A mixed-integer linear programming model for the PM/DNWPFSP is established. The problem characteristics and preventive maintenance characteristics of the PM/DNWPFSP are analyzed, and an accelerated calculation method of the completion time is proposed. A hybrid artificial bee colony (HABC) algorithm with an iterated local search mechanism for neighborhood search is proposed. To improve the quality of the solution, the shift, the swap and the hybrid operators are conducted in the critical factory. A local search operator based on the shift, the swap and the hybrid operators is proposed to jump out of local optima. A large number of experiments are conducted to evaluate the performance of the proposed HABC. The experimental results show that the proposed HABC algorithm has many promising advantages in solving the PM/DNWPFSP.
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.000 |
| 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