Personnel Tour Scheduling When Starting-Time Restrictions Are Present

Published Online:https://doi.org/10.1287/mnsc.44.4.534

References

  • Andrews B. H., Parsons H. L. L. L. Bean chooses a telephone agent scheduling system. Interfaces (1989) 19(6):1–9LinkGoogle Scholar
  • Bailey J. E. Integrated days off and shift personnel scheduling. Comput. Indust. Engrg. (1985) 9(4):395–404CrossrefGoogle Scholar
  • Bailey J. E., Field J. Personnel scheduling with flexshift models. J. Oper. Management (1985) 5(3):327–338CrossrefGoogle Scholar
  • Baker K. R. Scheduling a full-time workforce to meet cyclic staffing requirements. Management Sci. (1974) 20(12):1561–1568LinkGoogle Scholar
  • Baker K. R. Workforce allocation in cyclical scheduling problems: A survey. Oper. Res. Quart. (1976) 27(1):155–167CrossrefGoogle Scholar
  • Baker K. R., Burns R. N., Carter M. Staff scheduling with day-off and workstretch constraints. AIIE Trans. (1979) 11(4):286–292CrossrefGoogle Scholar
  • Baker K. R., Magazine M. J. Workforce scheduling with cyclic demands and day-off constraints. Management Sci. (1977) 24(2):161–167LinkGoogle Scholar
  • Bartholdi J. J. III. A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Oper. Res. (1981) 29(3):501–510LinkGoogle Scholar
  • Bartholdi J. J. III., Orlin J. B., Ratliff H. D. Cyclic scheduling via integer programs with circular ones. Oper. Res. (1980) 28(5):1074–1085LinkGoogle Scholar
  • Bartholdi J. J. III., Ratliff H. D. Unnetworks with applications to idle time scheduling. Management Sci. (1978) 24(8):850–858LinkGoogle Scholar
  • Bechtold S. E. Implicit optimal and heuristic labor staffing in a multiobjective multilocation environment. Decision Sci. (1988) 19(2):353–373CrossrefGoogle Scholar
  • Bechtold S. E., Brusco M. J. Working set generation methods for labor tour scheduling. Eur. J. Oper. Res. (1994) 74(3):540–551CrossrefGoogle Scholar
  • Bechtold S. E., Brusco M. J., Showalter M. J. A comparative evaluation of labor tour scheduling methods. Decision Sci. (1991) 22(4):683–699CrossrefGoogle Scholar
  • Bechtold S. E., Jacobs L. W. Implicit modeling of flexible break assignments in optimal shift scheduling. Management Sci. (1990) 36(11):1339–1351LinkGoogle Scholar
  • Bechtold S. E., Jacobs L. W. The equivalence of general set-covering and implicit integer programming formulations for shift scheduling. Naval Res. Logist. (1996) 43(2):233–249CrossrefGoogle Scholar
  • Bechtold S. E., Showalter M. J. A methodology for labor scheduling in a service operating system. Decision Sci. (1987) 18(1):89–107CrossrefGoogle Scholar
  • Blais J., Lamont J., Rousseau J. The hastus vehicle and manpower scheduling systems at the société de transport de la communauté urbalne de montréal. Interfaces (1990) 20(1):26–42LinkGoogle Scholar
  • Brusco M. J., Jacobs L. W. A simulated annealing approach to the cyclic staff-scheduling problem. Naval Res. Logist. (1993) 40(1):69–84CrossrefGoogle Scholar
  • Brusco M. J., Jacobs L. W. A cost analysis of alternative formulations for personnel scheduling in continuously operating organizations. Eur. J. Oper. Res. (1995) 86(2):249–261CrossrefGoogle Scholar
  • Brusco M. J., Jacobs L. W., Bongiorno R. J., Lyons D. V., Tang B. Improving personnel scheduling at airline stations. Oper. Res. (1995) 43(5):741–751LinkGoogle Scholar
  • Buffa E. S., Cosgrove M. J., Luce B. J. An integrated work shift scheduling system. Decision Sci. (1976) 7(4):620–630CrossrefGoogle Scholar
  • Burns R. N., Carter M. W. Work force size and single shift schedules with variable demands. Management Sci. (1985) 31(5):599–607LinkGoogle Scholar
  • Burns R. N., Koop G. J. A modular approach to optimal multiple-shift manpower scheduling. Oper. Res. (1987) 35(1):100–110LinkGoogle Scholar
  • Byrne J. L., Potts R. B. Scheduling of toll collectors. Transportation Sci. (1973) 7:224–245LinkGoogle Scholar
  • Dantzig G. B. A comment on Edie's “Traffic delays at toll booths.”. Oper. Res. (1954) 2(3):339–341LinkGoogle Scholar
  • Easton F. F., Rossin D. F. Sufficient working subsets for the tour scheduling problem. Management Sci. (1991) 37(11):1441–1451LinkGoogle Scholar
  • Edie L. C. Traffic delays at toll booths. Oper. Res. (1954) 2(1):107–138LinkGoogle Scholar
  • Emmons H. Workforce scheduling with cyclic requirements and constraints on days off, weekends off, and workstretch. IIE Trans. (1985) 17:8–16CrossrefGoogle Scholar
  • Emmons H., Burns R. N. Off-day scheduling with hierarchical worker categories. Oper. Res. (1991) 39(3):484–495LinkGoogle Scholar
  • Gaballa A., Pearce W. Telephone sales manpower planning at Qantas. Interfaces (1979) 9(3):1–9LinkGoogle Scholar
  • Gopalakrishnan M., Gopalakrishnan S., Miller D. M. A decision support system for scheduling personnel in a newspaper publishing environment. Interfaces (1993) 23(4):104–115LinkGoogle Scholar
  • Holloran T. J., Byrn J. E. United airlines station manpowerplanning system. Interfaces (1986) 16(1):39–50LinkGoogle Scholar
  • Hung R. Multiple-shift workforce scheduling under the 3–4 workweek with different weekday and weekend requirements. Management Sci. (1994) 40(2):280–284LinkGoogle Scholar
  • Jacobs L. W., Bechtold S. E. Labor utilization effects of labor scheduling flexibility alternatives in a tour scheduling environment. Decision Sci. (1993) 24(1):148–166CrossrefGoogle Scholar
  • Jacobs L. W., Brusco M. J. Overlapping start-time bands in implicit tour scheduling. Management Sci. (1996) 42(9):1247–1259LinkGoogle Scholar
  • Jarrah A., Bard J. F., deSilva A. Solving large scale tour scheduling problems. Management Sci. (1994) 40(9):1124–1144LinkGoogle Scholar
  • Keith E. G. Operator scheduling. AIIE Trans. (1979) 11(1):37–41CrossrefGoogle Scholar
  • Lauer J., Jacobs L. W., Brusco M. J., Bechtold S. E. An interactive, optimization-based decision support system for scheduling part-time computer lab attendants. Omega (1994) 22(6):613–626CrossrefGoogle Scholar
  • Love R., Hoey J. Management science improves fast-food operations. Interfaces (1990) 20(2):21–29LinkGoogle Scholar
  • McGinnis L. F., Culver W. D., Deane R. H. One- and two-phase heuristics for workforce scheduling. Comput. Indust. Engrg. (1978) 2(1):7–15CrossrefGoogle Scholar
  • Morris J. G., Showalter M. J. Simple approaches to shift, days-off, and tour scheduling problems. Management Sci. (1983) 29(8):942–950LinkGoogle Scholar
  • Schindler S., Semmel T. Station staffing at pan American world airways. Interfaces (1993) 23(3):91–106LinkGoogle Scholar
  • Schrage L.User's Manual for Linear, Integer, and Quadratic Programming with LINDO (1991) (The Scientific Press). Release 5.0Google Scholar
  • Taylor P. E., Huxley S. J. A break from tradition for the San Francisco police: Patrol officer scheduling using an optimization-based decision support system. Interfaces (1989) 19(1):4–24LinkGoogle Scholar
  • Thompson G. M. Improved implicit optimal modeling of the shift scheduling problem. Management Sci. (1995) 41(5):595–607LinkGoogle Scholar
  • Thompson G. M. A simulated annealing heuristic for shift scheduling using non-continuously available employees. Comput. Oper. Res. (1996a) 23(2):275–288CrossrefGoogle Scholar
  • Thompson G. M. Pareto frontiers for action times and profitability in workforce shift schedules. (1996b) . Working paper, Cornell University, Ithaca, New YorkGoogle Scholar
  • Wermus M., Pope J. A. Scheduling harbor pilots. Interfaces (1994) 24(2):44–52LinkGoogle Scholar
  • Willis R. J., Huxford S. B. Staffing rosters with breaks—A case study. J. Oper. Res. Soc. (1991) 42(9):727–731Google Scholar
  • Wilson E. J. G., Willis R. J. Scheduling of telephone betting operators—A case study. J. Oper. Res. Soc. (1983) 34(10):991–998Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.