The simple and multiple job assignment problems

International Journal of Production Research

Volumn 38, Issue 14, 2000, Pages 3165-3179

  Chauvet, F ^a   Proth, J M ^a   Soumare, A ^b  

^a INRIA   (France)

^b France   (Mauritania)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSTS; HEURISTIC METHODS; ITERATIVE METHODS; LINEAR PROGRAMMING; PROBLEM SOLVING;

BOTTLENECK ASSIGNMENT PROBLEMS (BAP);

PROCESS ENGINEERING;

EID: 0034692653     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075400418207     Document Type: Article

References (11)

1. Arora, S. and Puri, M. C., 1998, A variant of time minimizing assignment problem. European Journal of Operational Research, 110, 314-325.
2. DeMaio, A. O. and Roveda, C. A., 1971, An all zero-one algorithm for a certain class of transportation problems. Op. Res., 19, 1406-1418.
3. Francis, R. L. and White, J. A., 1974, Facility Layout and Location (Englewood Cliffs, New Jersey, Prentice-Hall).
4. Garfinkel, R. S. and Rao, M. R., 1971, The bottleneck transportation problem. Naval Research Logistics Quarterly, 18, 465-472.
5. Garfinkel, R. S., Neebe, A. W. and Rao, M. R., 1977, The m-center problem: minimax facility location. Management Sci., 23, 1133-1142.
6. Kuhn, H. W., 1955, The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2, 83-97.
7. Mazzola, J. B. and Neebe, A. W., 1988, Bottleneck generalized assignment problem. Eng. Costs Prod. Economics, 14, 61-65.
8. Mazzola, J.B. and Neebe, A. W., 1993, An algorithm for the bottleneck generalized assignment problem. Computers Ops. Res., 20, 355-362.
9. Neebe, A. W. and Rao, M. R., 1983, An algorithm for the hxed-charge assigning users to sources problems. Journal Operational Research Society, 34, 1107-1113.
10. Seshan, C. R., 1987, A parallel branch and bound algorithm of the quadratic assignment problem. Discrete and Applied Mathematics, 18, 211-225.
11. Srinivasan, V. and Thompson, G. L., 1973, An algorithm for assigning users to sources in a special case of transportation problem. Ops. Res., 21, 284-295.