The Contextual Appointment Scheduling Problem

• URL: http://arxiv.org/abs/2108.05531v1
• Date: Thu, 12 Aug 2021 04:51:26 GMT
• Title: The Contextual Appointment Scheduling Problem
• Authors: Nima Salehi Sadghiani, Saeid Motiian
• Abstract summary: We formulate ASP as an Integrated Estimation and Optimization problem using a task-based loss function. We justify the use of contexts by showing that not including the them yields to inconsistent decisions, which translates to sub-optimal appointments.
• Score: 4.644923443649425
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This study is concerned with the determination of optimal appointment times for a sequence of jobs with uncertain duration. We investigate the data-driven Appointment Scheduling Problem (ASP) when one has $n$ observations of $p$ features (covariates) related to the jobs as well as historical data. We formulate ASP as an Integrated Estimation and Optimization problem using a task-based loss function. We justify the use of contexts by showing that not including the them yields to inconsistent decisions, which translates to sub-optimal appointments. We validate our approach through two numerical experiments.

Related papers

• Task load dependent decision referrals for joint binary classification in human-automation teams [5.004501184476518]
  We consider the problem of optimal decision referrals in human-automation teams performing binary classification tasks. We provide a ranking scheme and a policy to determine the optimal set of tasks for referral. Results show statistically significant gains for the proposed optimal referral policy over a blind policy.
  arXiv  Detail & Related papers  (2025-04-05T19:09:04Z)
• Exploring Rewriting Approaches for Different Conversational Tasks [63.56404271441824]
  The exact rewriting approach may often depend on the use case and application-specific tasks supported by the conversational assistant. We systematically investigate two different approaches, denoted as rewriting and fusion, on two fundamentally different generation tasks. Our results indicate that the specific rewriting or fusion approach highly depends on the underlying use case and generative task.
  arXiv  Detail & Related papers  (2025-02-26T06:05:29Z)
• Online Data Collection for Efficient Semiparametric Inference [41.49486724979923]
  We present two online data collection policies, Explore-then-Commit and Explore-then-Greedy, that use the parameter estimates at a given time to optimally allocate the remaining budget in the future steps. We prove that both policies achieve zero regret (assessed by MSE) relative to an oracle policy.
  arXiv  Detail & Related papers  (2024-11-05T15:40:53Z)
• Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis [21.834696252131405]
  This paper demonstrates that Empirical Cumulative Distribution Functions can be used to compare MaxSAT local search solvers' anytime performance. The assessment reveals distinctions in solvers' performance and displays that the (dis)advantages of solvers adjust along different running times.
  arXiv  Detail & Related papers  (2024-03-11T10:10:35Z)
• Experiment Planning with Function Approximation [49.50254688629728]
  We study the problem of experiment planning with function approximation in contextual bandit problems. We propose two experiment planning strategies compatible with function approximation. We show that a uniform sampler achieves competitive optimality rates in the setting where the number of actions is small.
  arXiv  Detail & Related papers  (2024-01-10T14:40:23Z)
• Data-CUBE: Data Curriculum for Instruction-based Sentence Representation Learning [85.66907881270785]
  We propose a data curriculum method, namely Data-CUBE, that arranges the orders of all the multi-task data for training. In the task level, we aim to find the optimal task order to minimize the total cross-task interference risk. In the instance level, we measure the difficulty of all instances per task, then divide them into the easy-to-difficult mini-batches for training.
  arXiv  Detail & Related papers  (2024-01-07T18:12:20Z)
• Active Ranking of Experts Based on their Performances in Many Tasks [72.96112117037465]
  We consider the problem of ranking n experts based on their performances on d tasks. We make a monotonicity assumption stating that for each pair of experts, one outperforms the other on all tasks.
  arXiv  Detail & Related papers  (2023-06-05T06:55:39Z)
• Multi-task Bias-Variance Trade-off Through Functional Constraints [102.64082402388192]
  Multi-task learning aims to acquire a set of functions that perform well for diverse tasks. In this paper we draw intuition from the two extreme learning scenarios -- a single function for all tasks, and a task-specific function that ignores the other tasks. We introduce a constrained learning formulation that enforces domain specific solutions to a central function.
  arXiv  Detail & Related papers  (2022-10-27T16:06:47Z)
• Collaborative Anomaly Detection [66.51075412012581]
  We propose collaborative anomaly detection (CAD) to jointly learn all tasks with an embedding encoding correlations among tasks. We explore CAD with conditional density estimation and conditional likelihood ratio estimation. It is beneficial to select a small number of tasks in advance to learn a task embedding model, and then use it to warm-start all task embeddings.
  arXiv  Detail & Related papers  (2022-09-20T18:01:07Z)
• Generalized Conflict-directed Search for Optimal Ordering Problems [18.231677739397973]
  We present GCDO, a branch-and-bound ordering method that generates an optimal total order of events. Due to its ability to reason over generalized conflicts, GCDO is much more efficient in finding high-quality total orders than the previous conflict-directed approach CDITO.
  arXiv  Detail & Related papers  (2021-03-31T18:46:48Z)
• Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP [0.4511923587827302]
  We consider a Multi-resource Partial-ordering Flexible Job-shop Scheduling (MPF-JSS) problem. The resources are flexible and can perform one or more operations depending on their properties. Experiments conducted on a set of instances extracted from a medium-sized semiconductor fault analysis lab indicate that our approach can find schedules for 87 out of 91 considered real-world instances.
  arXiv  Detail & Related papers  (2021-01-25T15:21:32Z)
• To Schedule or not to Schedule: Extracting Task Specific Temporal Entities and Associated Negation Constraints [2.053142696037897]
  State of the art research for date-time entity extraction from text is task agnostic. We show the efficacy of our method on the task of date-time understanding in the context of scheduling meetings for an email-based digital AI scheduling assistant.
  arXiv  Detail & Related papers  (2020-11-15T10:07:19Z)
• Improving Multi-Turn Response Selection Models with Complementary Last-Utterance Selection by Instance Weighting [84.9716460244444]
  We consider utilizing the underlying correlation in the data resource itself to derive different kinds of supervision signals. We conduct extensive experiments in two public datasets and obtain significant improvement in both datasets.
  arXiv  Detail & Related papers  (2020-02-18T06:29:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.