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

In this paper, we develop distribution-free models that solve the appointment sequencing and scheduling problems by assuming only moments information of job durations. We show that our min-max appointment scheduling models, which minimize the worst-case expected waiting and overtime costs out of...

Managing appointments for service systems with random job durations is a challenging task. We consider a class of appointment planning problems that involve two sets of decisions: job sequencing, i.e., determining the order in which a list of jobs should be performed by the server, and...