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