메뉴 건너뛰기




Volumn 39, Issue 1, 1996, Pages 88-98

Combinatorial approaches for hard problems in manpower scheduling

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0347691576     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.39.88     Document Type: Article
Times cited : (12)

References (12)
  • 1
    • 84987014456 scopus 로고
    • A network model for rotating workforce scheduling problem
    • N. Balaktishnan and R. T. Wong. A network model for rotating workforce scheduling problem. Networks, 20:25-32, 1990.
    • (1990) Networks , vol.20 , pp. 25-32
    • Balaktishnan, N.1    Wong, R.T.2
  • 3
    • 0001357071 scopus 로고
    • Covering the points of a digraph with point-disjoint paths and its application to code generation
    • F. T. Boesch and J. F. Gimpel. Covering the points of a digraph with point-disjoint paths and its application to code generation. J. Assoc. Comput. Mach., 24(2):192-198, 1977.
    • (1977) J. Assoc. Comput. Mach. , vol.24 , Issue.2 , pp. 192-198
    • Boesch, F.T.1    Gimpel, J.F.2
  • 4
    • 0023171522 scopus 로고
    • A modular approach to optimal multiple-shift manpower scheduling
    • R. N. Burns and G. J. Koop. A modular approach to optimal multiple-shift manpower scheduling. Ops. Res., 35(1):100-110, 1987.
    • (1987) Ops. Res. , vol.35 , Issue.1 , pp. 100-110
    • Burns, R.N.1    Koop, G.J.2
  • 5
    • 0021429773 scopus 로고
    • A multi-level bottleneck assignment approach to the bus drivers' rostering problem
    • P. Carraresi and G. Gallo. A multi-level bottleneck assignment approach to the bus drivers' rostering problem. Euro. J. Ops. Res., 16:163-173, 1984.
    • (1984) Euro. J. Ops. Res. , vol.16 , pp. 163-173
    • Carraresi, P.1    Gallo, G.2
  • 6
    • 0002499479 scopus 로고
    • Minimum concave-cost network flow problems: Applications, complexity and algorithms
    • G. M. Guisewite and P. M. Pardalos. Minimum concave-cost network flow problems: Applications, complexity and algorithms. Annals Ops. Res., 25:75-100, 1990.
    • (1990) Annals Ops. Res. , vol.25 , pp. 75-100
    • Guisewite, G.M.1    Pardalos, P.M.2
  • 7
    • 0039057207 scopus 로고
    • ROMAN: An integrated approach to manpower planning and scheduling
    • O. Balci, R. Sharda, and S. Zenios, editors, Pergammon Press
    • C. M. Khoong and H. C. Lau. ROMAN: An integrated approach to manpower planning and scheduling. In O. Balci, R. Sharda, and S. Zenios, editors, CS & OR: New Development in Their Interfaces, pages 383-396. Pergammon Press, 1992.
    • (1992) CS & OR: New Development in Their Interfaces , pp. 383-396
    • Khoong, C.M.1    Lau, H.C.2
  • 8
    • 0026368116 scopus 로고
    • Nurse scheduling on a microcomputer
    • M. M. Kostreva and K. S. Jennings. Nurse scheduling on a microcomputer. Computers Ops. Res., 18(8):106-117, 1991.
    • (1991) Computers Ops. Res. , vol.18 , Issue.8 , pp. 106-117
    • Kostreva, M.M.1    Jennings, K.S.2
  • 9
    • 4043079142 scopus 로고
    • Manpower scheduling with shift change constraints
    • Springer Verlag Lect. Notes Comp. Sci. (834)
    • H. C. Lau. Manpower scheduling with shift change constraints. In Proc. 5th Int'l. Symp. Algorithms and Computation (ISAAC), pages 616-624. Springer Verlag Lect. Notes Comp. Sci. (834), 1994.
    • (1994) Proc. 5th Int'l. Symp. Algorithms and Computation (ISAAC) , pp. 616-624
    • Lau, H.C.1
  • 11
    • 0020495059 scopus 로고
    • A heuristic approach to the bus driver scheduling problem
    • S. Martello and P. Toth. A heuristic approach to the bus driver scheduling problem. Euro. J. Ops. Res., 24(1):106-117, 1986.
    • (1986) Euro. J. Ops. Res. , vol.24 , Issue.1 , pp. 106-117
    • Martello, S.1    Toth, P.2
  • 12
    • 0001518161 scopus 로고
    • On manpower scheduling algorithms
    • J. Tien and A. Kamiyama. On manpower scheduling algorithms. SIAM Review, 24(3):275-287, 1982.
    • (1982) SIAM Review , vol.24 , Issue.3 , pp. 275-287
    • Tien, J.1    Kamiyama, A.2


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