Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/118892
Title: A STOCHASTIC APPROACH TO APPOINTMENT SEQUENCING
Authors: AHMAD REZA POURGHADERI
Keywords: Appointment Sequencing and Scheduling, Break Time Scheduling, Out-patient Scheduling, Stochastic Orders, Surgery Scheduling, Unpunctuality and No-show
Issue Date: 20-Aug-2014
Source: AHMAD REZA POURGHADERI (2014-08-20). A STOCHASTIC APPROACH TO APPOINTMENT SEQUENCING. ScholarBank@NUS Repository.
Abstract: WE STUDY AN APPOINTMENT-BASED QUEUE WITH TWO CLASSES OF CUSTOMERS WHOSE EXCESS SERVICE TIMES ARE STOCHASTICALLY ORDERED. THE OBJECTIVE IS TO FIND THE OPTIMAL ARRIVAL SEQUENCE TO MINIMIZE THE TOTAL CUSTOMER WAITING TIME. WE FIRST SHOW THAT THE OPTIMAL SEQUENCE DOES NOT FOLLOW THE SHORTEST EXPECTED PROCESSING TIME FIRST (SEPT) AND THE SMALLEST VARIANCE FIRST (SV) RULES IN GENERAL. A SUFFICIENT CONDITION TO VIOLATE THE OPTIMALITY OF SEPT/SV IS FOUND. THEN WE IDENTIFY AND PROVE AN IMPORTANT PROPERTY OF THE OPTIMAL SEQUENCE IMPLYING THAT EACH FAST CUSTOMER MUST BE SCHEDULED IN THE FIRST HALF OF THE POSITIONS AFTER THE PREVIOUS FAST CUSTOMER, THE FIRST HALF RULE (FHR). AN EFFECTIVE SEQUENCING POLICY IS DEVELOPED BASED ON FHR, AND THE ANALYSIS IS EXTENDED TO ADDRESSEE TWO IMPORTANT PRACTICAL ISSUES: SERVER UNPUNCTUALITY AND CUSTOMER NO-SHOWS. THE RESULTS COULD BE APPLIED TO SCHEDULE THE BREAKS IN AN APPOINTMENT SYSTEM WITH HOMOGENEOUS CUSTOMERS AS WELL.
URI: http://scholarbank.nus.edu.sg/handle/10635/118892
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
PourghaderiAR.pdf2.01 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

137
checked on Jan 21, 2018

Download(s)

23
checked on Jan 21, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.