A metaheuristic algorithm based on Ant Colony Based approach for the assigning tasks problem to a workforce with different skills
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
This paper studies the problem of assigning tasks to a workforce with different skills. The problem is modeled as an unrelated parallel scheduling problem, incorporating sequence-dependent setup times (UPMSPSDST). Exact methods generally are not able to solve real large problems of UPMSPSDST. Hence, this research introduces an efficient, straightforward metaheuristic solution leveraging the Ant Colony Optimization (ACO) algorithm. The objective is to minimize the total completion time while assigning jobs to unrelated parallel machines with sequence-dependent preparation times. The algorithm establishes a threshold for improving the Ants (solutions) to select only promising ants for the improvement phase, thereby reducing the computational effort performed by local search operators. The proposed ACO algorithm maintains a basic structure and could be extended to solve other scheduling problems. A set of test instances available in the literature has been used to validate the efficiency of the proposed methodology. In addition, the results have been compared with the best previously published works. The ACO algorithm improves 30% of the best-known solutions (BKS) and reaches 30% of the BKS. The results show that the average performance of the ACO algorithm exceeds the average performance of the methods used by the best previously published works for the UPMSPSDST.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 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