Scheduling of Operations in a Large-Scale Scientific Services Facility via Multicommodity Flow and an Optimization-Based Algorithm
Bibliographic record
Abstract
Success of companies in the scientific services sector highly relies on the effective scheduling of operations as large numbers of samples from customers are received and analyzed and reports are generated for each sample. Therefore, it is extremely important to efficiently use all the various resources (labor and machine) for such facilities to remain competitive. This study focuses on the development of an algorithm to schedule operations in an actual large scale scientific services plant using models based on multicommodity flow (MCF) and integer linear programming (IP) techniques. The proposed scheduling algorithm aims to minimize the total turnaround time of the operations subject to capacity, resource, and flow constraints. The basic working principles of the optimization-based algorithm are illustrated with a small representative case study, while its relevance and significance are demonstrated through another case study of a real large scale plant. In the latter case study, the algorithm’s results are compared against historical data and results obtained by simulating the current policy implemented in the real plant, i.e., first-come, first-served. Besides obtaining significantly better results in terms of turnaround time, the results of the algorithm also displayed less variance when compared to historical data.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".