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

NASH EQUILIBRIUM IN INDUSTRIAL CLUSTERING: A CONCEPTUAL REVIEW

In order to reach their own targets, companies need to develop strategies by taking into consideration benefits of their rivals. Otherwise, they will experience conflict of interests among themselves and be affected by c...

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...

RANKING OF MANUFACTURING INDUSTRY SECTORS IN TURKEY WITH THE HELP OF PROMETHEE MULTIMOORA AND SMAA-2 METHODS

In recent years, industrial sector has affected the competition policies of both developed and developing countries. Especially after the economic crises, the importance of the manufacturing industry has been emphasized...

CASH MANAGEMENT SYSTEM DESIGN BY CENTRAL CASH OFFICE LOCATION AND INVENTORY MANAGEMENT POLICY OPTIMIZATION

In this study, we consider location selection problem for central cash offices and cash management decisions for ATM’s for İş Bank. Cash Management System involves the cash amounts held in ATM’s, branches, central cash o...

BIOMASS LOGISTICS MANAGEMENT FOR BIOGAS POWER PRODUCTION FACILITY

The biogas power plant, which generates energy from biomass, uses animal waste to reach its energy production target, and it hasstarted to collaborate with about 150 farms within the area. In this project, the amount of...

Download PDF file
  • EP ID EP673101
  • DOI -
  • Views 61
  • 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