Evidence map›Paper›PMID 35634093›Full record

ArticleComputers & industrial engineering2022

Two-stage robust telemedicine assignment problem with uncertain service duration and no-show behaviours.

Menglei Ji, Shanshan Wang, Chun Peng, Jinlin Li

Abstract read
In one paragraph

Article in Computers & industrial engineering, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Menglei JiSchool of Management and Economics, Beijing Institute of Technology, Beijing 100081, China.
Shanshan WangDepartment of Decision Sciences, HEC Montréal & GERAD, Montréal H3T 2A7, Canada.
Chun PengDepartment of Decision Sciences, HEC Montréal & GERAD, Montréal H3T 2A7, Canada.
Jinlin LiSchool of Management and Economics, Beijing Institute of Technology, Beijing 100081, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The current pandemic of COVID-19 has caused significant strain on medical center resources, which are the main plac healthcare managers to make an effective assignment plan for the patients and telemedical doctors when providing telemedicine services. Motivated by this, we present the first comprehensive study of a two-stage robust telemedicine assignment problem when three different sources of uncertainty are incorporated, including uncertain service duration, no-show behaviours of both patients and telemedical doctors. From an algorithmic viewpoint, we propose an efficient nested column-and-constraint generation (C&CG) solution scheme that decomposes the model into an outer level problem and an inner level problem. Our results show that we can solve the problems of realistic sizes within a reasonable time (e.g., up to 100 patients, 10 telemedical doctors, and 200 scenarios within two hours). On the empirical side, we demonstrate how the hyper-parameters make a balance between cost management and the coverage level of the served patients in the presence of three different sources of uncertainty. Our comparison with a two-stage stochastic programming model implies that our model is not overly conservative and seems to provide a relatively cheaper modeling alternative that requires much less information support when hedging against three different sources of uncertainty under a worst-case situation.

Indexed as

Mixed-integer linear programNested C&CGNo-show behavioursTelemedicine assignmentTwo-stage robust optimizationUncertain service duration

Identifiers

PMID35634093
PMCPMC9124295

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.