Robust Metaheuristics for Scheduling Cellular Flowshop with Family 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
In manufacturing systems, minimization of the total flow time has a great impact on the production time, the productivity and the profitability of a firm. This paper considers a cellular flowshop scheduling problem with family sequence setup time to minimize the total flow time. Two metaheuristic algorithms based on Genetic algorithm (GA) and particle swarm optimization (PSO) are proposed to solve the proposed problem. As it is customarily accepted, the performance of the proposed algorithms is evaluated using Design of Experiments (DOE) to study the robustness of the proposed metaheuristics based on the Relative Percentage Deviation (RPD) from the lower bounds. The results of the DOE evaluation of the proposed algorithms show that PSO-based metaheuristic is better than GA for solving scheduling problems in cellular flow shop, which aims to minimize the total flow time.
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