FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4310251762> ?p ?o ?g. }

• W4310251762 endingPage "87" @default.
• W4310251762 startingPage "70" @default.
• W4310251762 abstract "Problem definition: This paper studies an appointment system where a finite number of customers are scheduled to arrive in such a way that (1) the expected waiting time of each individual customer cannot exceed a given threshold; and (2) the appointment times are set as early as possible (without breaking the waiting time constraint). Methodology/results: First, we show that, under the service-level constraint, a prospective schedule can be obtained from a sequential scheduling approach. In particular, we can schedule the appointment time of the next customer based on the scheduled appointment times of the previous customers. Then, we use a transient queueing-analysis approach and apply the theory of majorization to analytically characterize the structure of the optimal appointment schedule. We prove that, to keep the expected waiting time of each customer below a certain threshold, the minimum inter-appointment time required increases with the arrival sequence. We further identify additional properties of the optimal schedule. For example, a later arrival has a higher chance of finding an empty system and is more likely to wait less than the duration of his expected service time. We show the convergence of the service-level-constrained system to the D/M/1 queueing system as the number of arrivals approaches infinity and propose a simple, yet practical, heuristic schedule that is asymptotically optimal. We also develop algorithms that can help system managers determine the number of customers that can be scheduled in a fixed time window. We compare the service-level-constrained appointment system with other widely studied systems (including the equal-space and cost-minimization systems). We show that the service-level-constrained system leads to a lower upper bound on each customer’s waiting time; ensures a fair waiting experience among customers; and performs quite well in terms of system overtime. Finally, we investigate various extended settings of our analysis, including customer no-shows; mixed Erlang service times; multiple servers; and probability-based service-level constraints. Managerial implications: Our results provide guidelines on how to design appointment schedules with individual service-level constraints. Such a design ensures fairness and incorporates the threshold-type waiting perception of customers. It is also free from cost estimation and can be easily applied in practice. In addition, under the service-level-constrained appointment system, customers with later appointment times can have better waiting experiences, in contrast to the situation under other commonly studied systems. Funding: Z. Yan was partly supported by a Nanyang Technological University startup grant; the Ministry of Education Academic Research Fund Tier 1 [Grant RG17/21] and Tier 2 [Grant MOE2019-T2-1-045]; and Neptune Orient Lines [Fellowship Grant NOL21RP04]. Supplemental Material: The online supplement is available at https://doi.org/10.1287/msom.2022.1159 ." @default.
• W4310251762 created "2022-11-30" @default.
• W4310251762 creator A5002330493 @default.
• W4310251762 creator A5009426535 @default.
• W4310251762 creator A5034251845 @default.
• W4310251762 creator A5076984563 @default.
• W4310251762 date "2023-01-01" @default.
• W4310251762 modified "2023-10-13" @default.
• W4310251762 title "Appointment Scheduling Under a Service-Level Constraint" @default.
• W4310251762 cites W1512019713 @default.
• W4310251762 cites W1591733991 @default.
• W4310251762 cites W1968596177 @default.
• W4310251762 cites W1970693366 @default.
• W4310251762 cites W1997351904 @default.
• W4310251762 cites W2007261666 @default.
• W4310251762 cites W2020300476 @default.
• W4310251762 cites W2027017614 @default.
• W4310251762 cites W2028815334 @default.
• W4310251762 cites W2056417120 @default.
• W4310251762 cites W2078724364 @default.
• W4310251762 cites W2085688626 @default.
• W4310251762 cites W2086738452 @default.
• W4310251762 cites W2095155399 @default.
• W4310251762 cites W2108830656 @default.
• W4310251762 cites W2145769891 @default.
• W4310251762 cites W2145859674 @default.
• W4310251762 cites W2160644054 @default.
• W4310251762 cites W2162676662 @default.
• W4310251762 cites W2257931904 @default.
• W4310251762 cites W2307788505 @default.
• W4310251762 cites W2472113677 @default.
• W4310251762 cites W2543253245 @default.
• W4310251762 cites W2748194799 @default.
• W4310251762 cites W2946249651 @default.
• W4310251762 cites W2995959105 @default.
• W4310251762 cites W2998004193 @default.
• W4310251762 cites W3124891448 @default.
• W4310251762 cites W3144148384 @default.
• W4310251762 cites W4247950673 @default.
• W4310251762 cites W4292058084 @default.
• W4310251762 cites W4362223606 @default.
• W4310251762 cites W4377862661 @default.
• W4310251762 cites W4378674620 @default.
• W4310251762 doi "https://doi.org/10.1287/msom.2022.1159" @default.
• W4310251762 hasPublicationYear "2023" @default.
• W4310251762 type Work @default.
• W4310251762 citedByCount "2" @default.
• W4310251762 countsByYear W43102517622023 @default.
• W4310251762 crossrefType "journal-article" @default.
• W4310251762 hasAuthorship W4310251762A5002330493 @default.
• W4310251762 hasAuthorship W4310251762A5009426535 @default.
• W4310251762 hasAuthorship W4310251762A5034251845 @default.
• W4310251762 hasAuthorship W4310251762A5076984563 @default.
• W4310251762 hasConcept C111919701 @default.
• W4310251762 hasConcept C126255220 @default.
• W4310251762 hasConcept C136264566 @default.
• W4310251762 hasConcept C162324750 @default.
• W4310251762 hasConcept C206729178 @default.
• W4310251762 hasConcept C22684755 @default.
• W4310251762 hasConcept C2524010 @default.
• W4310251762 hasConcept C2776036281 @default.
• W4310251762 hasConcept C2780378061 @default.
• W4310251762 hasConcept C31258907 @default.
• W4310251762 hasConcept C33923547 @default.
• W4310251762 hasConcept C41008148 @default.
• W4310251762 hasConcept C42475967 @default.
• W4310251762 hasConcept C68387754 @default.
• W4310251762 hasConceptScore W4310251762C111919701 @default.
• W4310251762 hasConceptScore W4310251762C126255220 @default.
• W4310251762 hasConceptScore W4310251762C136264566 @default.
• W4310251762 hasConceptScore W4310251762C162324750 @default.
• W4310251762 hasConceptScore W4310251762C206729178 @default.
• W4310251762 hasConceptScore W4310251762C22684755 @default.
• W4310251762 hasConceptScore W4310251762C2524010 @default.
• W4310251762 hasConceptScore W4310251762C2776036281 @default.
• W4310251762 hasConceptScore W4310251762C2780378061 @default.
• W4310251762 hasConceptScore W4310251762C31258907 @default.
• W4310251762 hasConceptScore W4310251762C33923547 @default.
• W4310251762 hasConceptScore W4310251762C41008148 @default.
• W4310251762 hasConceptScore W4310251762C42475967 @default.
• W4310251762 hasConceptScore W4310251762C68387754 @default.
• W4310251762 hasIssue "1" @default.
• W4310251762 hasLocation W43102517621 @default.
• W4310251762 hasOpenAccess W4310251762 @default.
• W4310251762 hasPrimaryLocation W43102517621 @default.
• W4310251762 hasRelatedWork W1987783546 @default.
• W4310251762 hasRelatedWork W2046131757 @default.
• W4310251762 hasRelatedWork W2147193423 @default.
• W4310251762 hasRelatedWork W2367877056 @default.
• W4310251762 hasRelatedWork W2903899051 @default.
• W4310251762 hasRelatedWork W2995016501 @default.
• W4310251762 hasRelatedWork W4246856022 @default.
• W4310251762 hasRelatedWork W4250545572 @default.
• W4310251762 hasRelatedWork W579272104 @default.
• W4310251762 hasRelatedWork W2065128788 @default.
• W4310251762 hasVolume "25" @default.
• W4310251762 isParatext "false" @default.
• W4310251762 isRetracted "false" @default.

• next