Design and Analysis of Hospital Throughput Maximization Algorithm under COVID-19 Pandemic
Bibliographic record
Abstract
Under the global pandemic of COVID-19, public health facilities, such as hospitals, are required to readjust, design, and plan a safe movement flow of people to meet the social distance rules and quarantine COVID-19 and the non-COVID-19 patients to prevent cross-infection. However, readjustments to separate patients have significantly reduced the maximum throughput of public health facilities, worsening already scarce public health resources. Therefore, this paper proposes throughput maximization algorithms based on the one-way street problem which meets the requirements of social distance rules. First, the floor plan of a hospital is transformed into a graph, each node is traversed by breadth-first search. Then, this paper considers patients' node pair sets as different set unions, the direction of edges, and the color of links based on DFS-XOR algorithm are designed to distinguish the paths of COVID-19 and non-COVID-19 patients. Finally, this paper utilizes minimum shared link algorithms to determine the minimized sharing links between paths linking different set unions and components. The throughput is maximized by reducing the number of shared links and alternating links. The results indicate that compared with the brute force algorithms, the algorithms proposed in this paper significantly improve the maximum throughput.
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 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.006 | 0.010 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".