메뉴 건너뛰기




Volumn 50, Issue 3, 2004, Pages 381-393

A Polyhedral Approach for the Staff Rostering Problem

Author keywords

Cutting plane and facet defining inequalities; Integer programming; Manpower planning; Rostering; Scheduling

Indexed keywords

INTEGER PROGRAMMING; MANAGEMENT; OPERATIONS RESEARCH; PLANNING; PROBLEM SOLVING; PROFESSIONAL ASPECTS; SCHEDULING; SOCIETIES AND INSTITUTIONS;

EID: 1842732646     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.1030.0142     Document Type: Review
Times cited : (37)

References (26)
  • 1
    • 0030125115 scopus 로고    scopus 로고
    • Optimal shift scheduling with multiple break windows
    • Aykin, T. 1996. Optimal shift scheduling with multiple break windows. Management Sci. 42 591-602.
    • (1996) Management Sci. , vol.42 , pp. 591-602
    • Aykin, T.1
  • 2
    • 84896876201 scopus 로고
    • Workforce allocation in cyclical scheduling problems: A survey
    • Baker, K. 1976. Workforce allocation in cyclical scheduling problems: A survey. Oper. Res. Quart. 27 155-167.
    • (1976) Oper. Res. Quart. , vol.27 , pp. 155-167
    • Baker, K.1
  • 3
    • 84987014456 scopus 로고
    • A network model for the rotating workforce scheduling problem
    • Balakrishnan, N., R. Wong. 1990. A network model for the rotating workforce scheduling problem. Networks 20 25-42.
    • (1990) Networks , vol.20 , pp. 25-42
    • Balakrishnan, N.1    Wong, R.2
  • 4
    • 0019562318 scopus 로고
    • A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering
    • Bartholdi III, J. 1981. A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Oper. Res. 29(3) 501-510.
    • (1981) Oper. Res. , vol.29 , Issue.3 , pp. 501-510
    • Bartholdi III, J.1
  • 5
    • 0019059991 scopus 로고
    • Cyclic scheduling via integer programs with circular ones
    • Bartholdi III, J., J. Orlin, H. Ratliff. 1980. Cyclic scheduling via integer programs with circular ones. Oper. Res. 28(5) 1074-1085.
    • (1980) Oper. Res. , vol.28 , Issue.5 , pp. 1074-1085
    • Bartholdi III, J.1    Orlin, J.2    Ratliff, H.3
  • 6
    • 0031140763 scopus 로고    scopus 로고
    • Scheduling staff using mixed integer programming
    • Beaumont, N. 1997. Scheduling staff using mixed integer programming. Eur. J. Oper. Res. 98(3) 473-484.
    • (1997) Eur. J. Oper. Res. , vol.98 , Issue.3 , pp. 473-484
    • Beaumont, N.1
  • 7
    • 0028765130 scopus 로고
    • Working set generation methods for labor tour scheduling
    • Bechtold, S., M. Brusco. 1994. Working set generation methods for labor tour scheduling. Eur. J. Oper. Res. 74 540-551.
    • (1994) Eur. J. Oper. Res. , vol.74 , pp. 540-551
    • Bechtold, S.1    Brusco, M.2
  • 8
    • 0000309722 scopus 로고
    • Implicit modeling of flexible break assignment in optimal shift scheduling
    • Bechtold, S., L. Jacobs. 1990. Implicit modeling of flexible break assignment in optimal shift scheduling. Management Sci. 36 1339-1351.
    • (1990) Management Sci. , vol.36 , pp. 1339-1351
    • Bechtold, S.1    Jacobs, L.2
  • 9
    • 4243163526 scopus 로고    scopus 로고
    • The equivalence of general setcovering and implicit integer programming formulation for shift scheduling
    • Bechtold, S., L. Jacobs. 1996. The equivalence of general setcovering and implicit integer programming formulation for shift scheduling. Naval Res. Logist. 43 233-249.
    • (1996) Naval Res. Logist. , vol.43 , pp. 233-249
    • Bechtold, S.1    Jacobs, L.2
  • 10
    • 84985773391 scopus 로고
    • A comparative evaluation of labor tour scheduling methods
    • Bechtold, S., M. Brusco, M. Showalter. 1991. A comparative evaluation of labor tour scheduling methods. Decision Sci. 22 683-699.
    • (1991) Decision Sci. , vol.22 , pp. 683-699
    • Bechtold, S.1    Brusco, M.2    Showalter, M.3
  • 14
    • 0016872537 scopus 로고
    • Scheduling of work forces required in continuous operations under alternative labor policies
    • Brownell, W., J. Lowerre. 1976. Scheduling of work forces required in continuous operations under alternative labor policies. Management Sci. 22(5) 597-605.
    • (1976) Management Sci. , vol.22 , Issue.5 , pp. 597-605
    • Brownell, W.1    Lowerre, J.2
  • 15
    • 0027543260 scopus 로고
    • A Simulated annealing approach to cyclic staff-scheduling problem
    • Brusco, M., L. Jacobs. 1993. A Simulated annealing approach to cyclic staff-scheduling problem. Naval Res. Logist. 40 69-84.
    • (1993) Naval Res. Logist. , vol.40 , pp. 69-84
    • Brusco, M.1    Jacobs, L.2
  • 16
    • 0032050742 scopus 로고    scopus 로고
    • Personnel tour scheduling when starting-time restriction are present
    • Brusco, M., L. Jacobs. 1998. Personnel tour scheduling when starting-time restriction are present. Management Sci. 44 534-547.
    • (1998) Management Sci. , vol.44 , pp. 534-547
    • Brusco, M.1    Jacobs, L.2
  • 17
    • 0000722156 scopus 로고
    • A comment on Edie's traffic delay at toll booths
    • Dantzig, G. 1954. A comment on Edie's traffic delay at toll booths. Oper. Res. 2(3) 339-341.
    • (1954) Oper. Res. , vol.2 , Issue.3 , pp. 339-341
    • Dantzig, G.1
  • 18
    • 0001296956 scopus 로고
    • Sufficient working subsets for the tour scheduling problem
    • Easton, F., D. Rossin. 1991. Sufficient working subsets for the tour scheduling problem. Management Sci. 37 1441-1451.
    • (1991) Management Sci. , vol.37 , pp. 1441-1451
    • Easton, F.1    Rossin, D.2
  • 19
    • 0032072578 scopus 로고    scopus 로고
    • A generalized linear programming model for nurse scheduling
    • Jaumard, B., F. Semet, T. Vovor. 1998. A generalized linear programming model for nurse scheduling. Eur. J. Oper. Res. 107(1) 1-18.
    • (1998) Eur. J. Oper. Res. , vol.107 , Issue.1 , pp. 1-18
    • Jaumard, B.1    Semet, F.2    Vovor, T.3
  • 20
    • 0020132677 scopus 로고
    • A simulation analysis of tour-shift construction procedures
    • Mabert, V. C. Watts. 1981. A simulation analysis of tour-shift construction procedures. Management Sci. 28(5) 520-532.
    • (1981) Management Sci. , vol.28 , Issue.5 , pp. 520-532
    • Mabert, V.1    Watts, C.2
  • 21
    • 0031999340 scopus 로고    scopus 로고
    • Cyclic and non-cyclic scheduling of 12h shift nurses by network programming
    • Millar, H., M. Kiragu. 1998. Cyclic and non-cyclic scheduling of 12h shift nurses by network programming. Eur. J. Oper. Res. 104 582-592.
    • (1998) Eur. J. Oper. Res. , vol.104 , pp. 582-592
    • Millar, H.1    Kiragu, M.2
  • 22
    • 0016994376 scopus 로고
    • Nurse scheduling using mathematical programming
    • Miller, H., W. Pierskalla, G. Rath. 1976. Nurse scheduling using mathematical programming. Oper. Res. 24(5) 857-870.
    • (1976) Oper. Res. , vol.24 , Issue.5 , pp. 857-870
    • Miller, H.1    Pierskalla, W.2    Rath, G.3
  • 23
    • 0016079835 scopus 로고
    • The operator-scheduling problem: A network-flow approach
    • Segal, M. 1974. The operator-scheduling problem: A network-flow approach. Oper. Res. 22 808-823.
    • (1974) Oper. Res. , vol.22 , pp. 808-823
    • Segal, M.1
  • 24
    • 0003332325 scopus 로고
    • Improved implicit optimal modeling of the labor shift scheduling problem
    • Thompson, G. 1995. Improved implicit optimal modeling of the labor shift scheduling problem. Management Sci. 41 595-607.
    • (1995) Management Sci. , vol.41 , pp. 595-607
    • Thompson, G.1
  • 25
    • 0016993816 scopus 로고
    • Scheduling nursing personnel according to nursing preference: A mathematical programming approach
    • Warner, D. 1976. Scheduling nursing personnel according to nursing preference: A mathematical programming approach. Oper Res. 24(5) 842-856.
    • (1976) Oper Res. , vol.24 , Issue.5 , pp. 842-856
    • Warner, D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.