The conference paper-reviewer assignment problem

Decision Sciences

Volumn 30, Issue 3, 1999, Pages 865-876

  Hartvigsen, David ^a   Wei, Jerry C ^a   Czuchlewski, Richard ^b  

^a UNIVERSITY OF NOTRE DAME   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

Assignment Problem; Network Theory; Optimization; Service Operations

Indexed keywords

EID: 0033272086     PISSN: 00117315     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1540-5915.1999.tb00910.x     Document Type: Conference Paper

References (20)

1. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows. Upper Saddle Ridge, NJ: Prentice-Hall.
2. Aronson, J. E. (1986). The multiperiod assignment problem: A multicommonality network flow model and specialized branch and bound algorithm. European Journal of Operational Research, 23, 367-381.
3. Bausch, D. O., Brown, G. G., Hundley, D. R., Rapp, S. H., & Rosenthal, R. E. (1991). Mobilizing marine corps officers. Interfaces, 21(4), 26-38.
4. Bechtold, S. E., & Showalter, M. J. (1987). A methodology for labor scheduling in a service operating system. Decision Sciences, 18, 89-107.
5. Carraresi, P., & Gallo, G. (1984). Network models for vehicle and crew scheduling. European Journal of Operational Research, 16, 139-151.
6. Carter, M. W., & Tovey, C. A. (1992). When is the classroom assignment problem hard? Operations Research, 40(1), S28-S39.
7. Derman, C., & Klein, M. (1959). A note on the optimal depletion of inventory. Management Science, 5, 210-214.
8. Ewashko, T. A., & Dudding, R. C. (1971). Application of Kuhn's Hungarian assignment algorithm to posting servicemen. Operations Research, 19, 991.
9. Franz, L. S., & Miller, J. L. (1993). Scheduling medical residents to rotations: Solving the large-scale multiperiod staff assignment problem. Operations Research, 41(2), 269-279.
10. Franz, L. S., Baker, H. M., Leong, G. K., & Rakes, T. R. (1989). A mathematical model for scheduling and staffing multiclinic health regions. European Journal of Operational Research, 41, 277-289.
11. Gilbert, K. C., & Hofstra, R. B. (1988). Multidimensional assignment problems. Decision Sciences, 19, 306-321.
12. Hansen, P., & Wendell, R. E. (1982). A note on airline commuting. Interfaces, 11 (12), 85-87.
13. Horn, W. A. (1973). Minimizing average flow time with parallel machines. Operations Research, 21, 846-847.
14. Klingman D., & Phillips, N. (1984). Topological and computational aspects of preemptive multicriteria military personnel assignment problems. Management Sciences, 30(1), 1362-1375.
15. Krajewski, L. J., Ritzman, L. P., & McKenzie, J. P. (1980). Shifting scheduling in banking operations: A case study application. Interfaces, 10, 1-6.
16. Machol, R. E. (1970). An application of the assignment problem. Operations Research, 18, 745-746.
17. Mason, A. J., & Philpott, A. B. (1988). Pairing stereo speakers using matching algorithms. Asia-Pacific Journal of Operational Research, 5, 101-116.
18. Mazzola, J. G., & Neebe, A. W. (1986). Resource-constrained assignment scheduling. Operations Research, 34, 560-572.
19. Ross, G. T., & Zoltners, A. A. (1979). Weighted assignment models and their application. Management Science, 25, 683-696.
20. Showalter, M. J., & Mabert, V. A. (1988). An evaluation of a full-/part-time tour scheduling methodology. International Journal of Operations and Production Management, 8, 54-71.