Workforce Design with Movement Restrictions Between Workstation Groups

References

• Bard J. F. Staff scheduling in high volume service facilities with downgrading. IIE Trans. Scheduling Logist. (2004a) 36(10):985–997Crossref, Google Scholar
• Bard J. F. Selecting the appropriate input data set when configuring a permanent workforce. Comput. Indust. Engrg. (2004b) 47(4):371–389Crossref, Google Scholar
• Bard J. F., Purnomo H. W. A column generation-based approach to solve the preference scheduling problem for nurses with downgrading. Socio-Econom. Planning Sci. (2005) 39(3):193–213Crossref, Google Scholar
• Bard J. F., Binici C., deSilva A. H. Staff scheduling at the United States Postal Service. Comput. Oper. Res. (2003) 30(5):745–771Crossref, Google Scholar
• Bechtold S. E., Brusco M. J. Working set generation methods for labor tour scheduling. Eur. J. Oper. Res. (1994) 74:540–551Crossref, Google Scholar
• Bechtold S. E., Jacobs L. W. Implicit modeling of flexible break assignments in optimal shift scheduling. Management Sci. (1990) 36(11):1339–1351Link, Google Scholar
• Berman O., Larson R. C., Pinker E. Scheduling workforce and workflow in a high volume factory. Management Sci. (1997) 43(2):158–172Link, Google Scholar
• Billionnet A. Integer programming to schedule a hierarchical workforce with variable demands. Eur. J. Oper. Res. (1999) 114:105–114Crossref, Google Scholar
• Campbell G. M., Diaby M. Development and evaluation of an assignment heuristic for allocating cross-trained workers. Eur. J. Oper. Res. (2002) 138(1):9–20Crossref, Google Scholar
• Dawid H., König J., Strauss C. An enhanced rostering model for airline crews. Comput. Oper. Res. (2001) 28:671–688Crossref, Google Scholar
• Emmons H., Burns R. N. Off-day scheduling with hierarchical worker categories. Oper. Res. (1991) 39(3):484–495Link, Google Scholar
• Ernst A. T., Jiang H., Krishnamoorthy M., Sier D. Staff scheduling and rostering: A review. Eur. J. Oper. Res. (2004) 153(1):3–27Crossref, Google Scholar
• Even S., Ital A., Shamir A. On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. (1976) 5:691–703Crossref, Google Scholar
• Franz L. S., Miller J. L. Scheduling medical residents to rotations: Solving the large-scale multi-period staff assignment problem. Oper. Res. (1993) 41(2):269–279Link, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, New York) Google Scholar
• Jarrah A. I. Z., Bard J. F., deSilva A. H. Solving large-scale tour scheduling problems. Management Sci. (1994) 40(9):1124–1144Link, Google Scholar
• Lin C. K. Y., Lai K. F., Hung S. L. Development of a workforce management system for a customer hotline service. Comput. Oper. Res. (2000) 27(10):987–1004Crossref, Google Scholar
• Malhotra M. K., Ritzman L. P. Scheduling flexibility in the service sector: A postal case study. Production Oper. Management (1994) 3:100–117Crossref, Google Scholar
• Misra S., Pinker E. J., Shumsky R. A. Salesforce design with experience-based learning. IIE Trans. Logist. Scheduling (2004) 36(10):941–952Crossref, Google Scholar
• Rekik M., Cordeau J.-F., Soumis F. Using Benders decomposition to implicitly model tour scheduling. Ann. Oper. Res. (2004) 128:111–133Crossref, Google Scholar
• Ritzman L. P., Krajewski L. J., Showalter M. J. The disaggregation of aggregate manpower plans. Management Sci. (1976) 22(2):1372–1380Google Scholar
• Sherali H. D., Smith J. C. Improving discrete model representations via symmetry considerations. Management Sci. (2001) 47(10):1396–1407Link, Google Scholar
• Wan L. Staff planning and scheduling in the service industry. (2005) . Doctoral dissertation, Graduate Program in Operations Research & Industrial Engineering, The University of Texas, Austin, TXGoogle Scholar