Optimization model of staffing for aircraft ground handling in the case of personnel substitutability
Bibliographic record
Abstract
The presented article deals with the mathematical modeling of aircraft ground handling on the service apron to utilize ground personnel more efficiently in the case of existing substitutability of workers. This article proposes a supporting decision-making tool for effective planning of the aircraft ground handling. This tool will be used for a selected type of aircraft and using the minimum number of personnel participating in the aircraft ground handling procedure. The optimization is based on the original mathematical programming model and its solution. Computational experiments verifying the functionality of the proposed model were performed on current data from the Ostrava International Regional Airport in the Czech Republic. The originality of the proposed approach (apart from the original model) comes with introducing the substitutability of workers of individual qualifications and the decomposition of workgroups composed of workers of the same qualification down to the level of individual workers. Above-mentioned decomposition of workgroups enables the flexible and separate transfer of individual workers included in the same groups between activities in the event of downtime of the given group and the existence of an activity that is not covered by the required number of workers. The substitutability of workers and the decomposition of individual groups down to the level of individual workers will make it possible to lower the number of workers or verify that the number of workers is optimal and eliminate potential staff downtime.
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.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 0.001 |
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".