메뉴 건너뛰기




Volumn 43, Issue 2, 1996, Pages 233-249

The equivalence of general set-covering and implicit integer programming formulations for shift scheduling

Author keywords

[No Author keywords available]

Indexed keywords


EID: 4243163526     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199603)43:2<233::AID-NAV5>3.0.CO;2-B     Document Type: Article
Times cited : (22)

References (25)
  • 1
    • 84896876201 scopus 로고
    • Workforce Allocation in Cyclical Scheduling Problems: A Survey
    • Baker, K.R., "Workforce Allocation in Cyclical Scheduling Problems: a Survey," Operational Research Quarterly, 27, 155-167 (1976).
    • (1976) Operational Research Quarterly , vol.27 , pp. 155-167
    • Baker, K.R.1
  • 2
    • 0042172086 scopus 로고
    • Computational Results for Very Large Air Crew Scheduling Problems
    • Baker, E., and Fisher, M., "Computational Results for Very Large Air Crew Scheduling Problems," OMEGA, 9, 613-618 (1981).
    • (1981) OMEGA , vol.9 , pp. 613-618
    • Baker, E.1    Fisher, M.2
  • 3
    • 0002905613 scopus 로고
    • Cutting Planes from Conditional Bounds: A New Approach to Set Covering
    • Balas, E., "Cutting Planes from Conditional Bounds: A New Approach to Set Covering," Mathematical Programming Study, 12, 19-36 (1980).
    • (1980) Mathematical Programming Study , vol.12 , pp. 19-36
    • Balas, E.1
  • 4
    • 0002590071 scopus 로고
    • Set Covering Algorithms Using Cutting Planes, Heuristics, and Subgradient Optimization: A Computational Study
    • Balas, E., and Ho, A., "Set Covering Algorithms Using Cutting Planes, Heuristics, and Subgradient Optimization: A Computational Study," Mathematical Programming Study, 12, 37-60 (1980).
    • (1980) Mathematical Programming Study , vol.12 , pp. 37-60
    • Balas, E.1    Ho, A.2
  • 5
    • 0024302011 scopus 로고
    • On the Set Covering Polytope: I. All the facets with coefficients in {0, 1, 2}
    • Balas, E., and Ng, S.M., "On the Set Covering Polytope: I. All the facets with coefficients in {0, 1, 2}," Mathematical Programming, 43, 57-69 (1989).
    • (1989) Mathematical Programming , vol.43 , pp. 57-69
    • Balas, E.1    Ng, S.M.2
  • 6
    • 0024718441 scopus 로고
    • On the Set Covering Polytope: II. Lifting the facets with coefficients in {0, 1, 2}
    • Balas, E., and Ng, S.M., "On the Set Covering Polytope: II. Lifting the facets with coefficients in {0, 1, 2}," Mathematical Programming, 45, 1-20 (1989).
    • (1989) Mathematical Programming , vol.45 , pp. 1-20
    • Balas, E.1    Ng, S.M.2
  • 8
    • 0025383362 scopus 로고
    • A Lagrangian Heuristic for Set-Covering Problems
    • Beasley, J.E., "A Lagrangian Heuristic for Set-Covering Problems," Naval Research Logistics, 37, 151-164 (1990).
    • (1990) Naval Research Logistics , vol.37 , pp. 151-164
    • Beasley, J.E.1
  • 9
    • 84985773391 scopus 로고
    • A Comparative Evaluation of Labor Tour Scheduling Methods
    • Bechtold, S.E., Brusco, M.J., and Showalter, M.J., "A Comparative Evaluation of Labor Tour Scheduling Methods," Decision Sciences, 22, 683-699 (1991).
    • (1991) Decision Sciences , vol.22 , pp. 683-699
    • Bechtold, S.E.1    Brusco, M.J.2    Showalter, M.J.3
  • 11
    • 0000309722 scopus 로고
    • Implicit Modeling of Flexible Break Assignments in Optimal Shift Scheduling
    • Bechtold, S.E., and Jacobs, L.W., "Implicit Modeling of Flexible Break Assignments in Optimal Shift Scheduling," Management Science, 36, 1339-1351 (1990).
    • (1990) Management Science , vol.36 , pp. 1339-1351
    • Bechtold, S.E.1    Jacobs, L.W.2
  • 12
    • 0025399824 scopus 로고
    • Annual Scheduling of Atlantic Fleet Naval Combatants
    • Brown, G.G., Goodman, C.E., and Wood, R.K., "Annual Scheduling of Atlantic Fleet Naval Combatants," Operations Research, 38, 249-259 (1990).
    • (1990) Operations Research , vol.38 , pp. 249-259
    • Brown, G.G.1    Goodman, C.E.2    Wood, R.K.3
  • 13
    • 0000722156 scopus 로고
    • A Comment on Edie's Traffic Delay at Toll Booths
    • Dantzig, G.B., "A Comment on Edie's Traffic Delay at Toll Booths," Operations Research, 3, 339-341 (1954).
    • (1954) Operations Research , vol.3 , pp. 339-341
    • Dantzig, G.B.1
  • 14
    • 0000554525 scopus 로고
    • Optimal Solution of Set Covering/Partitioning Problems
    • Fisher, M.L., and Kedia, P., "Optimal Solution of Set Covering/Partitioning Problems," Management Science, 36, 674-688 (1990).
    • (1990) Management Science , vol.36 , pp. 674-688
    • Fisher, M.L.1    Kedia, P.2
  • 15
    • 0023455954 scopus 로고
    • The Fixed Job Schedule Problem with Spread-Time Constraints
    • Fischetti, M., Martello, S., and Toth, P., "The Fixed Job Schedule Problem With Spread-Time Constraints," Operations Research, 35, 849-858 (1987).
    • (1987) Operations Research , vol.35 , pp. 849-858
    • Fischetti, M.1    Martello, S.2    Toth, P.3
  • 16
    • 0016985083 scopus 로고
    • Heuristic Methods for Telephone Operator Shift Scheduling: An Experimental Analysis
    • Henderson, W.B., and Berry, W.L., "Heuristic Methods for Telephone Operator Shift Scheduling: An Experimental Analysis," Management Science, 27, 1372-1380 (1976).
    • (1976) Management Science , vol.27 , pp. 1372-1380
    • Henderson, W.B.1    Berry, W.L.2
  • 18
    • 84990587419 scopus 로고
    • Labor Utilization Effects of Labor Scheduling Flexibility Alternatives in a Tour Scheduling Environment
    • Jacobs, L.W., and Bechtold, S.E., "Labor Utilization Effects of Labor Scheduling Flexibility Alternatives in a Tour Scheduling Environment," Decision Sciences, 24, 148-166 (1993).
    • (1993) Decision Sciences , vol.24 , pp. 148-166
    • Jacobs, L.W.1    Bechtold, S.E.2
  • 19
    • 0018444711 scopus 로고
    • Operator Scheduling
    • Keith, E.G., "Operator Scheduling," AIIE Transactions, 11, 37-41 (1979).
    • (1979) AIIE Transactions , vol.11 , pp. 37-41
    • Keith, E.G.1
  • 20
    • 0020797571 scopus 로고
    • Simple Approaches to Shift, Days-Off and Tour Scheduling Problems
    • Morris, J.G., and Showalter, M.J., "Simple Approaches to Shift, Days-Off and Tour Scheduling Problems," Management Science, 29, 942-950 (1983).
    • (1983) Management Science , vol.29 , pp. 942-950
    • Morris, J.G.1    Showalter, M.J.2
  • 21
    • 84989758909 scopus 로고
    • Interactive Optimization Methodology for Fleet Scheduling
    • Nulty, W.G., and Ratliff, H.D., "Interactive Optimization Methodology for Fleet Scheduling," Naval Research Logistics, 38, 669-677 (1991).
    • (1991) Naval Research Logistics , vol.38 , pp. 669-677
    • Nulty, W.G.1    Ratliff, H.D.2
  • 23
    • 0023985563 scopus 로고
    • IMPACS - A Bus Crew Scheduling System Using Integer Programming
    • Smith, B.M., "IMPACS - A Bus Crew Scheduling System Using Integer Programming," Mathematical Programming, 42, 181-187 (1988).
    • (1988) Mathematical Programming , vol.42 , pp. 181-187
    • Smith, B.M.1
  • 24
    • 85033858210 scopus 로고
    • Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem under Extraordinary Break Window Overlap
    • Working Paper, University of Utah, forthcoming
    • Thompson, G. M., "Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem under Extraordinary Break Window Overlap," Working Paper, University of Utah, 1994, forthcoming in Management Science.
    • (1994) Management Science
    • Thompson, G.M.1
  • 25
    • 0001518161 scopus 로고
    • On Manpower Scheduling Algorithms
    • Tien, J.M., and Kamiyama, A., "On Manpower Scheduling Algorithms," SIAM Review, 24, 275-287 (1982).
    • (1982) SIAM Review , vol.24 , pp. 275-287
    • Tien, J.M.1    Kamiyama, A.2


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