A variant of time minimizing assignment problem

European Journal of Operational Research

Volumn 110, Issue 2, 1998, Pages 314-325

  Arora, Shalini ^a   Puri, M C ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

Bottleneck assignment problem; Imbalanced assignment problem; Time minimizing assignment problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; RESOURCE ALLOCATION;

BOTTLENECK ASSIGNMENT PROBLEM; IMBALANCE ASSIGNMENT PROBLEM; TIME MINIMIZING ASSIGNMENT PROBLEM (TMAP);

OPERATIONS RESEARCH;

EID: 0032188528     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00266-X     Document Type: Article

References (46)

1. W.P. Adams, T.A. Johnson, Improved linear programming based lower bounds for the quadratic assignment problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16 (1994) 43-75.
2. V. Aggarwal, The assignment problem under categorized jobs, European Journal of Operational Research 14 (1983) 193-195.
3. V. Aggarwal, V.G. Tikekar, L.-F. Hsu, Bottleneck assignment problems under categorization, Computers and Operations Research 13 (1) (1986) 11-26.
4. E. Balas, S. Ceria, G. Cornuejols, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Mathematical Programming 58 (1993) 295-324.
5. R.S. Barr, F. Glover, D. Klingman, The alternating basis algorithm for assignment problems, Mathematical Programming 13 (1977) 1-13.
6. M.S. Bazzara, H.D. Sherali, Bender's partitioning scheme applied to a new formulation of the quadratic assignment problem, Naval Research Logistics Quarterly 27 (1980) 29-41.
7. M.S. Bazzara, H.D. Sherali, On the use of exact and heuristic cutting plane methods for the quadratic assignment problem, Journal of Operational Research Society 33 (1982) 991-1003.
8. O. Berman, D. Einav, G. Handler, The constrained bottleneck problem in networks, Operations Research 38 (1990) 178-181.
9. D.P. Bertsekas, A new algorithm for the assignment problem, Mathematical Programming 21 (1981) 152-171.
10. H.L. Bhatia, Time minimizing assignment problem, Systems and Cybernetics in Management 6 (1977) 75-83.
11. S.H. Bokhari, Assignment problems in distributed and parallel computing, Kluwer Academic Publishers, Boston, 1987.
12. A. Brandt, Y. Intrator, The assignment problem with three job categories, Casopis Pro Pestovani Matematiky 96 (1971) 8-11.
13. R.E. Burkard, E. Cela, B. Klinz, On the biquadratic assignment problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16 (1994) 117-146.
14. T.C.E. Cheng, C.C.S. Sin, A state-of-art review of parallel-machine scheduling research, European Journal of Operational Research 47 (1990) 271-292.
15. P. De, T.E. Morton, Scheduling to minimum makespan on unequal parallel processors, Decision Science 11 (1980) 586-602.
16. S. French, Sequencing and Scheduling - Introduction to the Mathematics of the Job Shop, Ellis Horwood, Chichester, 1982.
17. A.M. Frieze, Complexity of a 3-dimensional assignment problem, European Journal of Operational Research 14 (1983) 161-164.
18. A.M. Frieze, J. Yadegar, On the quadratic assignment problem, Discrete and Applied Mathematics 5 (1983) 89-98.
19. R.S. Garfinkel, An improved algorithm for bottleneck assignment problem, Operations Research 18 (1971) 1717-1751.
20. R.G. Parker, Deterministic Scheduling Theory, Chapman and Hall, 1995.
21. S. Ghose, The maximum capacity routes: A lexisearch approach, Opsearch 8 (3) (1971) 209-225.
22. P.C. Gilmore, Optimal and suboptimal algorithms for the quadratic assignment problem, SIAM Journal on Applied Mathematics 10 (1962) 305-313.
23. F. Glover, D. Karney, D. Klingman, Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems, Networks 4 (3) (1974) 191-212.
24. R.S. Hatch, Bench marks comparing transportation codes based on primal simplex and primal-dual algorithms, Operations Research 23 (1975) 1167-1171.
25. M.S. Hung, W.O. Rom, Solving the assignment problem by relaxation, Operations Research 28 (1980) 969-982.
26. T.C. Koopmans, M.J. Beckmann, Assignment problems and the location of economic activities, Econometrica 25 (1957) 53-76.
27. H.W. Kuhn, The Hungarian method for assignment problem, Naval Research Logistics Quarterly 2 (1956) 83-97.
28. E.L. Lawler, Combinatorial optimization, Networks and Matroids, Holt, Reinhart and Winston, New York, 1976.
29. E.L. Lawler, The quadratic assignment problem, Management Science 9 (1963) 586-599.
30. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, D.B. Shmoys, Sequencing and Scheduling: Algorithms and Complexity, Report BS-R8909, Centre for Mathematics and Computer Science, Amsterdam, 1989.
31. R. Malhotra, H.L. Bhatia, M.C. Puri, The three dimensional bottleneck assignment problem and its variants, Optimization 16 (1985) 245-256.
32. T. Mautor, C. Roucairol, Difficulties of exact methods for solving the quadratic assignment problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16 (1994) 263-274.
33. J.B. Mazzola, A.W. Neebe, Resource constraint assignment scheduling, Operations Research 34 (4) (1986) 560-572.
34. L.F. McGinnis, Implementation and testing of a primal-dual algorithm for the assignment problem, Operations Research 31 (1983) 277-291.
35. K.G. Murty, An algorithm for ranking all the assignments in order of increasing cost, Operations Research 16 (1968) 628-687.
36. S.N.N. Pandit, Y.V. Subrahmanyam, Enumeration of all optimal job sequence, Opsearch 12 (1-2) (1975) 35-39.
37. S.N.N. Pandit, M.S. Murthy, Allocation of sources and destinations, 8th Annual Convention of Operational Research Society of India, 1975, pp. 22-24.
38. P.M. Pardalos, J.V. Crouse, A parallel algorithm for the quadratic assignment problem, Proceedings Supercomputing 89 (1989) 351-360.
39. P. De, J.B. Ghosh, C.E. Wells, On the solution of a stochastic bottleneck assignment problem and its variants, Naval Research Logistics 39 (1992) 389-397.
40. A. Ravindran, V. Ramaswamy, On the bottleneck assignment problem, Journal of Optimization Theory And Applications 21 (1977) 451-458.
41. C. Roucairol, A parallel branch and bound algorithm for the quadratic assignment problem, Discrete and Applied Mathematics 18 (1987) 211-225.
42. C.R. Seshan, Some generalisations of time minimizing assignment problem, Journal of Operational Research Society 32 (1981) 489-494.
43. V. Srinivasan, G.L. Thompson, Accelerated algorithms for labeling and relabeling of trees with applications to distribution problems, Journal of Association for Computing Machinery 19 (1972) 712-726.
44. V. Srinivasan, G.L. Thompson, Benefit cost analysis of coding techniques for the primal transportation algorithm, Journal of Association for Computing Machinery 20 (1973) 194-213.
45. Y.V. Subrahmanyam, Some special cases of assignment problems, Opsearch 16 (1) (1979) 45-47.
46. V. Verma, Optimization over a polyhedral domain: Some Aspects, Ph.D. Thesis, IIT Delhi, 1990.