Extended Appendix to: Sequencing Appointments for Service Systems Using Inventory Approximations: Sequencing for Multiple Servers

7 Pages Posted: 12 Nov 2013

See all articles by Ho-Yin Mak

Ho-Yin Mak

University of Oxford - Said Business School

Ying Rong

Shanghai Jiao Tong University (SJTU) - Antai College of Economics and Management

Jiawei Zhang

New York University (NYU) - Department of Information, Operations, and Management Sciences

Date Written: November 11, 2013

Abstract

In this Extended Appendix, we extend the mixed integer second-order cone programming (MISOCP) formulation as well as the heuristics derived in Mak et al. (2013) to tackle the problem of assigning and sequencing appointments for multiple servers. Numerical examples are provided to demonstrate the effectiveness of the approximation.

The paper "Sequencing Appointments for Service Systems Using Inventory Approximations" to which these Appendices apply is available at the following URL: http://ssrn.com/abstract=2315640

Suggested Citation

Mak, Ho-Yin and Rong, Ying and Zhang, Jiawei, Extended Appendix to: Sequencing Appointments for Service Systems Using Inventory Approximations: Sequencing for Multiple Servers (November 11, 2013). Available at SSRN: https://ssrn.com/abstract=2352901 or http://dx.doi.org/10.2139/ssrn.2352901

Ho-Yin Mak (Contact Author)

University of Oxford - Said Business School ( email )

Park End Street
Oxford, OX1 1HP
Great Britain

Ying Rong

Shanghai Jiao Tong University (SJTU) - Antai College of Economics and Management ( email )

No.535 Fahuazhen Road
Shanghai Jiao Tong University
Shanghai, Shanghai 200052
China

Jiawei Zhang

New York University (NYU) - Department of Information, Operations, and Management Sciences ( email )

44 West Fourth Street
New York, NY 10012
United States

Register to save articles to
your library

Register

Paper statistics

Downloads
45
Abstract Views
381
PlumX Metrics