A PREFERENCE-BASED APPOINTMENT SCHEDULING PROBLEM WITH MULTIPLE PATIENT TYPES

Journal Title: Endüstri Mühendisliği - Year 2019, Vol 30, Issue 2

Abstract

This paper focuses on the appointment scheduling mechanism of a physician or a diagnostic resource in a healthcare facility. Multiple patient types with different revenues use the facility. The facility observes the number of appointment requests arriving from each patient type at the beginning of each day. It decides on how to allocate available appointment slots to these appointment requests. Patients prefer a day in the booking horizon with a specific probability and they have only one preference. Patients are either given an appointment for their preferred days or their appointment requests are rejected. The facility wants to keep the rejection costs at a certain level, while maximizing its revenues. This process is modeled with a discrete time and constrained Markov Decision Process to maximize the infinite-horizon expected discounted revenue. The constraint guarantees that the infinite-horizon expected discounted rejection cost is below a specific threshold. We have proved that the optimal policy is a randomized booking limit policy. To solve the model, we have implemented Temporal Difference (TD) Learning Algorithm, which is a well-known Approximate Dynamic Programming (ADP) method. We have compared the ADP results with other heuristics numerically.

Authors and Affiliations

Feray TUNÇALP, Lerzan ÖRMECİ

Keywords

Related Articles

PARALLEL PRODUCTION LINES WITH SEQUENCE-DEPENDENT SETUP TIMES AND SIDE CONSTRAINTS

We consider a scheduling problem observed in a soft-drink production facility with multiple production lines and sequence-dependent setup times. The primary objective is to obtain a weekly schedule that minimizes the tot...

MÜDEK REPORT CARD: AN ALTERNATIVE MODEL FOR ASSESSMENT OF PROGRAM OUTCOMES

Accreditation for undergraduate engineering education has become an indispensable quality assurance tool for the engineering schools in a world with ever-growing competition. ‘Association for Evaluation and Accreditation...

A LINE FEEDING SYSTEM DECIDING AGV NUMBERS AND STOCK AMOUNT NEAR LINES

In a company operating in the durable consumer goods sector and producing washing machines, the materials are kept in an interim stock area called supermarket before being sent to the assembly lines. Since there is no sp...

DEVELOPMENT OF A LOT SIZING AND SCHEDULING SYSTEM FOR AN AUTOMOTIVE SUPPLIER

In this study, lot sizing and scheduling problem is considered in an automotive supplier. As a result of the current system analysis, inappropriate mold-press machine assignments, quality losses due to these inappropriat...

DEMAND FORECASTING OF 3. ISTANBUL GRAND AIRPORT VIA ARTIFICIAL NEURAL NETWORKS AND ADAPTIVE NEURO FUZZY INFERENCE SYSTEMS FOR OPTIMIZATION OF DOMESTIC AIRCRAFT FLEET OF TURKISH AIRLINES

The aim of this study is to estimate the passenger and freight demand of the 3rd Istanbul Airport, which was built as a substitute for the Istanbul Ataturk Airport with Artificial Neural Network (ANN) and Adaptive Neuro...

Download PDF file
  • EP ID EP673101
  • DOI -
  • Views 73
  • Downloads 0

How To Cite

Feray TUNÇALP, Lerzan ÖRMECİ (2019). A PREFERENCE-BASED APPOINTMENT SCHEDULING PROBLEM WITH MULTIPLE PATIENT TYPES. Endüstri Mühendisliği, 30(2), 93-110. https://europub.co.uk/articles/-A-673101