The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Appointment Scheduling with Limited Distributional Information
Open accessAbstract
In this paper, we develop distribution-free models that solve the appointment sequencing and scheduling problem by assuming only moments information of job durations. We show that our min–max appointment scheduling models, which minimize the worst-case expected waiting and overtime costs out of all probability distributions with the given marginal moments, can be exactly formulated as tractable conic programs. These formulations are obtained by exploiting hidden convexity of the problem. In the special case where only the first two marginal moments are given, the problem can be reformulated as a second-order cone program. Based on the structural properties of this formulation, under a mild condition, we derive the optimal time allowances in closed form and prove that it is optimal to sequence jobs in increasing order of job duration variance. We also prove similar results regarding the optimal time allowances and sequence for the case where only means and supports of job durations are known. This paper was accepted by Dimitris Bertsimas, optimization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Appointment Scheduling in Health Care: Challenges and Opportunities
Gupta, D., & Denton, B. (2008) · IIE Transactions · doi:10.1080/07408170802165880 · Cited by 1,043
Cited by
Outpatient appointment systems in healthcare: A review of optimization studies
Ahmadi-Javid, A., Jalali, Z., & Klassen, K. J. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.06.064 · Cited by 434
Adaptive Distributionally Robust Optimization
Bertsimas, D., Sim, M., & Zhang, M. (2019) · Management Science · doi:10.1287/mnsc.2017.2952 · Cited by 326
Kuiper, A., de Mast, J., & Mandjes, M. (2021) · Omega · doi:10.1016/j.omega.2019.102122 · Cited by 43
Metadata
- Authors
- Mak, H.-Y., Rong, Y., & Zhang, J.
- Venue
- Management Science
- Published
- 2015-02
- Volume
- 61
- Issue
- 2
- Pages
- 316-334
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W3124891448
- Cited by
- 199
- References
- 1
- FWCI
- 18.90
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Appointment Scheduling with Limited Distributional Information. https://app.cochat.ai/papers/10.1287/mnsc.2013.1881
- The paper
- Mak, H.-Y., Rong, Y., & Zhang, J. (2015). Appointment Scheduling with Limited Distributional Information. Management Science. https://doi.org/10.1287/mnsc.2013.1881
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.