A Machine Operation Lists based Memetic Algorithm for Job Shop Scheduling
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 article, a new Memetic Algorithm (MA) has been proposed to solve Job Shop Scheduling Problems. The proposed MA is based on Machine Operation Lists (MOL), which is the exact sequence of operations for each machine. Machine Operation Lists representation is a modification of Preference List-Based representation. Linear Order Crossover (LOX) and Random operations are first considered as crossover and mutation operators for the proposed MA. Local Search heuristic (LS) of the proposed MA reconsiders all the operations of a job. It chooses a job and removes all of its operations and finally reassigns them again one by one in their sequencing order to improve the fitness value of the schedule. The proposed algorithm has been applied on the well-known benchmark of classical Job Shop Scheduling Problems (JSSP). Comparing it with the existing methods shows that the proposed MA and the proposed Genetic Algorithm (GA) without LS are effective in JSSP. Moreover, comparing the results of MA and GA shows that using LS not only improves the final results but also helps GA to converge to the final solution.
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.001 | 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