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
- EP ID EP673101
- DOI -
- Views 71
- Downloads 0
PRODUCTION LOGISTIC OPTIMIZATION WITH WCM METHODOLOGY AT A LEADING ICE CREAM MANUFACTURER
In the current system of a leading ice cream manufacturer, the production lines are fed by transpallets and this causes overstocks at the production stations with non-value added activities. The aim of the project is to...
AHP, TOPSIS AND HUNGARIAN ALGORITHM BASED DECISION SUPPORT MODEL FOR STAFF APPOINTMENT
Staff appointment is a very important issue in terms of increasing the motivation and productivity of the staff in an organization. Institutions should be as objective as possible when carrying out this process and infor...
A THREE OBJECTIVE MATHEMATICAL MODEL FOR ONE DIMENSIONAL CUTTING STOCK PROBLEM AND SOLUTION ALGORITHM
In this paper, a one-dimensional cutting stock problem is studied. One of the main difficulties in formulating and solving mathematical models for one-dimensional cutting stock problems, is the use a set of cutting patte...
CLOSED LOOP SUPPLY CHAIN NETWORK DESIGN PROBLEM
In this study, we address the closed loop supply chain network design problem, which integrates reverse flows and reverse supply chain activities into the traditional forward supply chain activities. This network design...
Design Study of an Automatic Valf Disassembly Machine in Depressurisation Process for Improving Production Efficiency
In this study, it is aimed to reduce the expenditure of the inefficient performance of automatic mono non-switched gas fitting and removal machine and also to reduce the labour costs of manually taking the tubes whose va...