A Polyhedral Approach for the Staff Rostering Problem

References

• Aykin T. Optimal shift scheduling with multiple break windows. Management Sci. (1996) 42:591–602Link, Google Scholar
• Baker K. Workforce allocation in cyclical scheduling problems: A survey. Oper. Res. Quart. (1976) 27:155–167Crossref, Google Scholar
• Balakrishnan N., Wong R. A network model for the rotating workforce scheduling problem. Networks (1990) 20:25–42Crossref, Google Scholar
• Bartholdi III J. A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Oper. Res. (1981) 29(3):501–510Link, Google Scholar
• Bartholdi III J., Orlin J., Ratliff H. Cyclic scheduling via integer programs with circular ones. Oper. Res. (1980) 28(5):1074–1085Link, Google Scholar
• Beaumont N. Scheduling staff using mixed integer programming. Eur. J. Oper. Res. (1997) 98(3):473–484Crossref, Google Scholar
• Bechtold S., Brusco M. Working set generation methods for labor tour scheduling. Eur. J. Oper. Res. (1994) 74:540–551Crossref, Google Scholar
• Bechtold S., Jacobs L. Implicit modeling of flexible break assignment in optimal shift scheduling. Management Sci. (1990) 36:1339–1351Link, Google Scholar
• Bechtold S., Jacobs L. The equivalence of general set-covering and implicit integer programming formulation for shift scheduling. Naval Res. Logist. (1996) 43:233–249Crossref, Google Scholar
• Bechtold S., Brusco M., Showalter M. A comparative evaluation of labor tour scheduling methods. Decision Sci. (1991) 22:683–699Crossref, Google Scholar
• Broggio G., Paoletti B. Operations research in industry: The Alitalia experience. AIRO News Bull. Italian Assoc. Oper. Res. (2000) V(2):1–3Google Scholar
• Broggio G., Felici G., Gentile C., Paoletti B. Ground resources roster planning. Proc. AGIFORS Oper. Control Ground Resources Joint Study Group Meeting. (1999a) . AGIFORS, Istanbul, Turkey. http://www.agifors.orgGoogle Scholar
• Broggio G., Felici G., Gentile C., Paoletti B. Ground resources roster planning. Proc. AGIFORS Sympos. (1999b) (AGIFORS, New Orleans, LA) Google Scholar
• Brownell W., Lowerre J. Scheduling of work forces required in continuous operations under alternative labor policies. Management Sci. (1976) 22(5):597–605Link, Google Scholar
• Brusco M., Jacobs L. A Simulated annealing approach to cyclic staff-scheduling problem. Naval Res. Logist. (1993) 40:69–84Crossref, Google Scholar
• Brusco M., Jacobs L. Personnel tour scheduling when starting-time restriction are present. Management Sci. (1998) 44:534–547Link, Google Scholar
• Dantzig G. A comment on Edie's traffic delay at toll booths. Oper. Res. (1954) 2(3):339–341Link, Google Scholar
• Easton F., Rossin D. Sufficient working subsets for the tour scheduling problem. Management Sci. (1991) 37:1441–1451Link, Google Scholar
• Jaumard B., Semet F., Vovor T. A generalized linear programming model for nurse scheduling. Eur. J. Oper. Res. (1998) 107(1):1–18Crossref, Google Scholar
• Mabert V., Watts C. A simulation analysis of tour-shift construction procedures. Management Sci. (1981) 28(5):520–532Link, Google Scholar
• Millar H., Kiragu M. Cyclic and non-cyclic scheduling of 12h shift nurses by network programming. Eur. J. Oper. Res. (1998) 104:582–592Crossref, Google Scholar
• Miller H., Pierskalla W., Rath G. Nurse scheduling using mathematical programming. Oper. Res. (1976) 24(5):857–870Link, Google Scholar
• Segal M. The operator-scheduling problem: A network-flow approach. Oper. Res. (1974) 22:808–823Link, Google Scholar
• Thompson G. Improved implicit optimal modeling of the labor shift scheduling problem. Management Sci. (1995) 41:595–607Link, Google Scholar
• Warner D. Scheduling nursing personnel according to nursing preference: A mathematical programming approach. Oper Res. (1976) 24(5):842–856Link, Google Scholar
• Wolsey L.Integer Programming (1998) (Wiley, New York, NY) Google Scholar