A Stochastic Goal Program for Employee Scheduling

A two-stage stochastic program for scheduling and allocating cross-trained workers

“…For example, when there is only one department, then there is no cross-training and no relevant second stage-that is, no allocation problem. In that case, TSSIP reduces to a problem similar to that studied by Easton and Rossin (1996). What happens to TSSIP if requirements are deterministic rather than stochastic?…”

“…Bard and Purnomo (2005) use a rolling horizon approach in conjunction with an integer program for reactive scheduling of nurses in a hospital. Easton and Rossin (1996) present a stochastic program for workforce scheduling and demonstrate its advantages relative to deterministic models.…”

Workforce scheduling with multiple objectives

“…Several studies indicate that workforce scheduling in sequence from Step 2 to Step 3 can give misleading results (for details see Rossin, 1996 andThompson, 1999). The main drawback presented in this sequence is that the optimal schedule is generated without considering the employee information; as a result, employees scheduled might not be available or the schedules produced might violate the applicable regulations (e.g., shift lengths and spacing of breaks).…”

“…As the planning periods get shorter, the stationary state assumption is also questionable in the SIPP approach. The reader is also referred to Thompson (1995), Easton and Rossin (1996), Goodale et al (2003) and Easton and Goodale (2005).…”

Quantitative Approaches on Staff Scheduling and Rostering in Hospitality Management: An Overview

“…Several variations of this problem can be found in literature: models that consider full or/and part-time employees (see for example [33]), different employees' productivity levels ([34,35]), staff mixed skills and weekend off requirements [36], over and understaffing [37], relief (rest or meal) breaks [38] or shifts with a limited number of starting times ( [39,40]). In a 2004 survey, Alfares [41] reviews approximately 70 tour scheduling papers published between the years of 1990 and 2001, comparing mathematical programming models and classifying them according to the applied solution methods.…”