A survey of the generalized assignment problem and its applications

INFOR

Volumn 45, Issue 3, 2007, Pages 123-141

  Öncan, Temel ^a  

^a GALATASARAY UNIVERSITY   (Turkey)

Author keywords

Applications; Generalized assignment problem; Knapsack

Indexed keywords

APPLICATIONS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; PRODUCTION CONTROL; SCHEDULING; SURVEYS;

FACILITY LOCATIONS; GENERALIZED ASSIGNMENT PROBLEM; KNAPSACK; OPTIMAL ASSIGNMENT; PRODUCTION PLANNING; REAL-LIFE APPLICATIONS; SOLUTION APPROACH; VARIABLE NEIGHBORHOOD SEARCH;

HEURISTIC ALGORITHMS;

EID: 45749151027     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.3138/infor.45.3.123     Document Type: Review

References (160)

1. Ahuja, R.K., Orlin, J.B., Pallottino, S., Scaparra, M.P., and Scutella, M.G. (2004) A multi-exchange heuristic for the single-source capacitated facility location problem. Management Science, 50 (6): 749-760.
2. Alfandari, L., Plateau, A., and Tolla, P. (2003) A path relinking algorithm for the generalized assignment problem, in Metaheuristics: Computer Decision Making, Kluwer Academic Publishers. M.G.C. Resende, and J.P. de Sousa, (eds.), Combinatorial Optimization Book Series, D-.Z. Du and P.M. Pardalos, Series Ed, 1-18.
3. Albareda-Sambola, M. and Fernández, E. (2000) The stochastic generalized assignment problem with Bernoulli demands. TOP 8: 165-190.
4. Albareda-Sambola, M., van der Vlerk, M.H., and Fernández, E. (2006) Exact solutions to a class of stochastic generalized assignment problems. European Journal of Operational Research, 173 (2): 465-487.
5. Amini, M.M. and Racer, M. (1994) A rigorous computational comparison of alternative solution methods for the generalized assignment problem. Management Science, 40 (7): 868-890.
6. Amini, M.M. and Racer, M. (1995) A hybrid heuristic for the generalized assignment problem. European Journal of Operational Research, 87: 343-348.
7. Amini, M.M., Racer, M., and Ghandforoush, P. (1998) Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study. European Journal of Operational Research, 108: 604-617.
8. Asahiro, Y., Ishibashi, M., and Yamashita, M. (2003) Independent and cooperative parallel search methods for the generalized assignment problem. Optimization Methods and Software, 18 (2): 129-141.
9. Babad, J.M., Balachandran, V., and Stohr, E.A. (1976) Management of program storage in computers. Management Science, 23 (4): 380-390.
10. Baker, M.B. (1992) Further improvements to vehicle routeing heuristics. Journal of the Operational Research Society, 43 (10): 1009-1012.
11. Baker, M.B. and Sheasby, J. (1999) Extensions to the generalized assignment heuristic for vehicle routing. European Journal of Operational Research, 119: 147-157.
12. Balachandran, V. (1972) An integer generalized transportation model for optimal job assignment in computer networks, Working Paper 34-72-3. Graduate School of Industrial Administration, Carnegie-Mellon University: Pittsburgh.
13. Barbas, J. and Marin, A. (2004) Maximal covering code multiplexing access telecommunication networks. European Journal of Operational Research, 159: 219-238.
14. Barcia, P. and Jörnsten, K. (1990) Improved Lagrangean decomposition. An application to the generalized assignment problem. European Journal of Operational Research, 46: 84-92.
15. Bar-Ilan, J., Kortsarz, G., and Peleg, D. (1993) How to allocate network centers. Journal of Algorithms, 15: 385-415.
16. Belenguer, J.M. and Benavent, E. (1998) The capacitated are routing problem: valid inequalities and facets. Computational Optimization and Applications, 10: 165-187.
17. Benders, J.F. and Van Nunen, J.A. (1983) A property of assignment type mixed linear programming problems. Operations Research Utters, 2: 47-52.
18. Benjaafer, S., ElHafsi, M., and de Véricourt, F. (2004) Demand allocation in multiple-product, multiple-facility, make-to-stock systems. Management Science, 50 (10): 1431-1448.
19. Berge, M.E., Hopperstad, C.A., and Haraldsdottir, A. (2003) Airline schedule recovery in collaborative flow management with airport and airspace capacity constraints. The 2003 US/Europe Air Traffic Management R&D Seminar, Budapest, June 2003.
20. Bressoud, T.C., Rastogi, R., and Smith, M.A. (2003) Optimal Configuration for BGP Route Selection, in Proceedings of IEEE INFOCOM' 2003, 2nd Annual Joint Conference on the IEEE Computer and Communications Societies, San Francisco, 2: 916-926.
21. Butler, T. and Mazzola, J.B. (1996) Improving service productivity: integer programming helps to improve the layout of parts-distribution center. OR Insights, 9: 2-7.
22. Boffey, T.B. (1989) Location problems arising in computer networks. Journal of the Operational Research Society, 40 (4): 347-354.
23. Campbell, G.M. (1999) Cross-utilization of workers whose capabilities differ. Management Science, 45 (5): 722-732.
24. Campbell, J.F. and Langevin, A. (1995) The snow disposal assignment problem. Journal of the Operational Research Society, 46: 919-929.
25. Campbell, G.M. and Diaby, M. (2002) Development and evaluation of an assignment heuristic for allocating cross-trained workers. European Journal of Operational Research, 138: 9-20.
26. Cario, M.C., Clifford, J.J., Hill, R.R., Yang, J., Yang, K., and Reilly, C.H. (2002) An investigation of the relationship between problem characteristics and algorithm performance: a case study of the generalized assignment problems. IIIE Transactions on Operation Engineering, 34 (3): 297-312.
27. Carreno, J.J. (1990) Economic lot scheduling for multiple products on parallel identical processors. Management Science, 36 (3): 348-358.
28. Carver, S. (1991) Integrating multi-criteria evaluation with geographical information systems. International Journal of Geographical Information Systems, 5: 321-339.
29. Caselli, A. and Righini, G. (2005) A branch-and-bound algorithm for the capacitated p-median problem. Networks, 45 (3): 125-142.
30. Caselli, A. and Righini, G. (2006) A branch-and-price algorithm for the multilevel generalized assignment problem. Operations Research, 54 (6): 1172-1184.
31. Cattrysse, D.G. (1990) Set partitioning approaches to combinatorial optimization problems; PhD Thesis, Katholieke University Leuven, Department Wertuigkunde, Centrum Industrieel Beleid, Belgium.
32. Cattrysse, D.G., Salomon, M., and Van Wassenhove, L.N. (1994) A set partitioning heuristic for the generalized assignment problem. European Journal of Operational Research, 72: 167-174.
33. Cattrysse, D.G., Degraeve, Z., and Tistaert, J. (1998) Solving the generalized assignment problem using polyhedral results. European Journal of Operational Research, 108: 618-628.
34. Cattrysse, D.G. and Van Wassenhove, L.N. (1992) A survey of algorithms for the generalized assignment problem. European Journal of Operational Research, 60: 260-272.
35. Chalmet, L. and Gelders, L. (1976) Lagrangean relaxation for a generalized assignment-type problem. In: Roubens, M. (ed.); EURO: North-Holland, Amsterdam, Advances on OR, pages 103-109.
36. Cheng, C.H., Madan, M.S., and Motwani, J. (1996) Knapsack-based algorithms for designing cellular manufacturing systems. Journal of the Operational Research Society, 47: 1468-1476.
37. Cheng, C.H., Goh, C-H., and Lee, A. (1996) Solving the generalized machine assignment problem in group technology. Journal of the Operational Research Society, 47: 794-802.
38. Chu, P.C. and Beasley, J.E. (1997) A genetic algorithm for the generalized assignment problem. Computers and Operations Research, 24 (1): 17-23.
39. Cohen, R., Katzir, L., and Raz, D. (2006) An efficient approximation for the generalized assignment problem, Information Processing Letters, 100 100: 162-166.
40. Correno, J.J. (1990) Economic lot scheduling for multiple products on parallel identical processors. Management Science, 36 (3): 348-358.
41. Cordeau, J-F., Gaudioso, M., Laporte, G., and Moccia, L. (2006) A memetic heuristic for the generalized quadratic assignment problem. INFORMS Journal of Computing, 18 (4): 433-443.
42. Correno, J.J. (1990) Economic lot scheduling for multiple products on parallel identical processors. Management Science, 36 (3): 348-358.
43. Cromley, R.G. and Hanink, D.M. (1999) Coupling land use allocation models with raster GIS. Journal of Geographical Systems, 1: 137-153.
44. De Farias, I.R., Johnson, E.L., Jr., and Nemhauser, G.L. (2000) A generalized assignment problem with special ordered sets: a polyhedral approach. Mathematical Programming Ser. A, 89: 187-203.
45. De Maio, A. and Roveda, C. (1971) An all zero-one algorithm for a certain class of transportation problems. Operations Research, 19: 1406-1418.
46. Díaz, J.A. and Fernández, E. (2001) A tabu search heuristic for the generalized assignment problem. European Journal of Operational Research, 132: 22-38.
47. Dobson, G. and Nambimadom, R.S. (2001) The batch loading and scheduling problem. Operations Research, 49 (1): 52-65.
48. Drexl, A. (1991) Scheduling of project networks by job assignment. Management Science, 37 (12): 1590-1602.
49. Ferland, J.A. (1997) Generalized assignment-type problems a powerful modeling scheme. In: Burke, E.K. and Carter, M.W. (eds.). The Practice and Theory of Automated Timetabling II. Springer Lecture Notes in Computer Science, 1408, 53-77.
50. Ferland, J.A., Hertz, A., and Lavoie, A. (1996) An object-oriented methodology for solving assignment-type problems with neighborhood search techniques. Operations Research, 44 (2): 347-359.
51. Fisher, M.L. (1981) The Lagrangian relaxation method for solving integer programming problems. Management Science, 27 (1): 1-18.
52. Fisher, M.L. (2004) The Lagrangian relaxation method for solving integer programming problems. Management Science, 50 (12): 1861-1871.
53. Fisher, M.L. and Jaikumar, R. (1981) A generalized assignment heuristic for vehicle routing. Networks, 11: 109-124.
54. Fisher, M.L., Jaikumar, R., and Van Wassenhove, L.N. (1986) A multiplier adjustment method for the generalized assignment problem. Management Science, 32: 1095-1183.
55. Fleischer, L., Goemans, M.X., Mirrokni, V.S., and Sviridenko, M. (2006) Tighter approximation algorithms for maximum general assignment problems, in: SODA'06: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 611-620.
56. Foulds, L.R. and Wilson, J.M. (1997) A variation of the generalized assignment problem arising in the New Zealand dairy industry. Annals of Operations Research, 69: 105-114.
57. Freling, R., Romeijn, H.E., Romero-Morales, D., and Wagelmans, A.P.M. (2003) A branch-and-price algorithm for the multiperiod single-source problem. Operations Research, 51 (6): 922-939.
58. French, A.P. and Wilson, J.M. (2002) Heuristic solution methods for the multilevel generalized assignment problem. Journal of Heuristics,8: 143-153.
59. French, A.P. and Wilson, J.M. (2002) An LP-based heuristic procedure for the generalized assignment problem with special ordered sets. Computers and Operations Research, 34: 2359-2369.
60. Frize, A. and Jadegar, J. (1983) On the quadratic assignment problem. Discrete Applied Mathematics, 5: 89-98.
61. Gavish, B. and Pirkul, H. (1991) Algorithms for the multi-resource assignment problem. Management Science, 37 (6): 695-713.
62. Gavish, B. and Pirkul, H. (1986) Computer and database location in distributed computer systems. IEEE Transactions on Computers, 35: 583-590.
63. Geoffrion, A.M. (1974) Lagrangean relaxation for integer programming. Mathematical Programming Studies, 2: 82-114.
64. Gheysens, F., Golden, B.L., and Assad, A. (1984) A comparison of techniques for solving the fleet size and mix vehicle routing problem. OR Spektrum, 6: 207-216.
65. Glover, F., Hultz, H., and Klingman, D. (1979) Improved computer based planning techniques-PartII. Interfaces, 9 (4): 12-20.
66. Glover, F. and Laguna, M. (1997) Tabu Search; Kluwer Academic Press: Boston.
67. Gottlieb, E.S. and Rao, M.R. (1990) Generalized assignment problem. Valid Inequalities and facets. Mathematical Programming Ser A, 46(1): 31-52.
68. Gottlieb, E.S. and Rao, M.R. (1990) (1,k)-Configuration facets for the generalized assignment problem. Mathematical Programming Ser A, 46(1): 53-60.
69. Gouveia, L. and Saldanha-da-Gama, F. (2006) On the capacitated concentrator location problem a reformulation by discretion. Computers and Operations Research, 33 (5): 1242-1258.
70. Guignard, M. and Rosenwein, M.B. (1989) An improved dual based algorithm for the generalized assignment problem. Operations Research, 37 (4): 658-663.
71. Haddadi, S. (1999) Lagrangian decomposition based heuristic for the generalized assignment problem. INFOR, 37 (4): 392-402.
72. Haddadi, S. and Ouzia, H. (2001) An effective Lagrangian heuristic for the generalized assignment problem. INFOR, 39 (4): 354-356.
73. Haddadi, S. and Ouzia, H. (2004) Effective algorithm and heuristic for the generalized assignment problem. European Journal of Operational Research, 153: 184-190.
74. Hadj-Alouane, A.B., Bean, J.C., and Murty, K.G. (1999) A hybrid genetic/optimization algorithm for a task allocation problem. Journal of Scheduling, 2: 189-201.
75. Hajri-Gabouj, S. (2003) A fuzzy genetic multiobjective optimization algorithm for a multilevel generalized assignment problem. IEEE Transactions on Systems, Man and Cybernetics-Part C:Appli-cations and Review, 33 (2): 214-224.
76. Hallefjord, A., Jörnsten, K.O., and Varbrand, P. (1993) Solving large scale generalized assignment problems - An aggregation/ disaggregation approach. European Journal of Operational Research, 64: 103-114.
77. Hannink, M.D. and Cromley, R.G. (1998) Land-use allocation in the absence of complete market values. Journal of Regional Science, 38 (3): 465-480.
78. Harvey, N.J.A., Ladner, R.E., Lovász, L., and Tamir, T. (2006) Semimatchings for bipartite graphs and load balancing. Journal of Algorithms, 59 (1): 53-78.
79. Held, M. and Karp, R.M. (1971) The traveling salesman problem and minimum spanning trees: part II. Mathematical Programming, 1: 6-25.
80. Higgins, A.J. (1999) Optimizing cane supply decisions within a sugar mill region. Journal of Scheduling, 2: 229-244.
81. Higgins, A.J. (2001) A dynamic tabu search for large-scale generalized assignment problem. Computers and Operations Research, 28: 1039-1048.
82. Jalisi, Q.W.Z. and Cheddad, H. (2000) Third party transportation: a case study. International Journal of Industrial Engineering: Theory Applications Practice, 7 (4): 348-351.
83. Jeet, V. and Kutanoǧlu, E. (2007) Lagrangean relaxation guided problem space search heuristic for generalized assignment problems. European Journal of Operational Research, 182 (3): 1039-1056.
84. Jörnsten, K. and Nasberg, M. (1986) A new Lagrangian relaxation approach to the generalized assignment problem. European Journal of Operational Research, 27: 313-323.
85. Kalagnanam, J.R., Davenport, A.J., and Lee, H.S. (2001) Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand. Electronic Commerce Research, 1: 221-238.
86. Klastorin, T.D. (1979) On the maximal covering location problem and the generalized assignment problem. Management Science, 25 (1): 107-112.
87. Kogan, K., Shtub, A., and Levit, V.E. (1997) DGAP - the dynamic generalized assignment problem. Annals of Operations Research, 69: 227-239.
88. Kogan, K., Khmelnitsky, E., and Ibaraki, T. (2005) Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships. Journal of Global Optimization, 31: 17-43.
89. Koskosidis, Y.A. and Powell, K. (1992) Clustering algorithms for consolidation of customer orders into vehicle shipments. Transportation Research Part B: Methodological, 26 (5): 365-379.
90. Kuhn, H.W. (1955) The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2: 83-97.
91. Laguna, M., Kelly, J.P., Gonzalez-Velarde, J.L., and Glover, F. (1995) Tabu search for the multilevel generalized assignment problem. European Journal of Operational Research, 82: 176-189.
92. LeBlanc, L.J., Shtub, A., and Anandalingam, G. (1999) Formulating and solving production planning problems. European Journal of Operational Research, 112: 54-80.
93. Lee, M-K. (1992) A storage assignment policy in a man-on-board automated storage/retrieval system. International Journal of Production Research, 30 (10): 2281-2292.
94. Lee, D-H. and Kim, Y-D. (1998) Multi-period order selection problem in flexible manufacturing systems. Journal of the Operational Research Society, 49 (3): 278-286.
95. Li, T. and Luyuan, F. (1991) Competition based neural networks for assignment problems. Journal of Computer Science and Technology, 6 (4): 305-315.
96. Li, T. and Ma, Z. (2003) The generalized quadratic assignment problem. Technical report. Department of Mechanical and Industrial Engineering, University of Torontoa: Toronto, Ontaria, Canada.
97. Lin, S. and Kernighan, B. (1973) An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21: 498-516.
98. Littschwager, J.M. and Tcheng, T.H. (1967) Solution of a large-scale forest scheduling problem by linear programming decomposition. Journal of Forestry, 65: 644-646.
99. Lorena, L.A. N. and Narciso, M.G. (1996) Relaxation heuristics for a generalized assignment problem. European Journal of Operational Research, 91: 600-610.
100. Lorena, L.A.N., Narciso, M.G., and Beasley, J.E. (1999) A constructive genetic algorithm for the generalized assignment problem. Evolutionary Optimization, (2nd version).
101. Lourenço, H.R.D. and Serra, D. (2002) Adaptive approach heuristics for the generalized assignment problem. Mathware and Soft Computing, 9: 209-234.
102. Martello, S. and Toth, P. (1981) An algorithm for the generalized assignment problem. In proceedings of the 9th IFORS conference, Hamburg, Germany.
103. Martello, S. and Toth, P. (1990) Knapsack Problems: Algorithms and Computer Implementations; John Wiley and Sons, Chichester, England.
104. Martello, S. and Toth, P. (1995) The bottleneck generalized assignment problem. European Journal of Operational Research, 83: 621-638.
105. Martello, S. and Toth, P. (1995) A note on exact algorithms for the bottleneck generalized assignment problem. European Journal of Operational Research, 83: 711-712.
106. Mazzola, J.B. (1989) Generalized assignment with nonlinear capacity interaction. Management Science, 35 (8): 923-941.
107. Mazzola, J.B. (1993) Algorithms for the bottleneck generalized assignment problem. Computers and Operations Research, 20 (4): 355-362.
108. Mazzola, J.B. and Neebe, A.W. (1993) The bottleneck generalized assignment problem. Computers and Operations Research, 20: 355-362.
109. Mazzola, J.B. and Neebe, A.W. (1988) Bottleneck generalized assignment problems. Engineering Costs and Production Economics, 14(1): 61-65.
110. Mazzola, J., Neebe, A., and Dunn, C. (1989) Production planning of a flexible manufacturing system in a material requirements planning environment. International Journal of Flexible Manufacturing Systems, 1 (2): 115-142.
111. Mazzola, J.B. and Schantz, R.H. (1997) Multiple-facility loading under capacity-based economies of scope. Naval Research Logistics, 44: 229-256.
112. Mazzola, J.B. and Wilcox, S.P. (2001) Heuristics for the multiresource generalized assignment problem. Naval Research Logistics, 48: 468-483.
113. Monfared, M.A.S. and Etemadi, M. (2006) The impact of energy function structure on solving generalized assignment problem using Hopfield neural network. European Journal of Operational Research, 168 (2): 645-654.
114. Mulvey, J. and Beck, M.P. (1984) Solving capacitated clustering problems. European Journal of the Operational Research, 18: 339-348.
115. Narciso, M.G. and Lorena, L.A.N. (1999) Lagrangean/surrogate relaxation for generalized assignment problems. European Journal of Operational Research, 114: 165-177.
116. Nauss, R.M. (2003) Solving the generalized assignment problem: an optimizing and heuristic approach. INFORMS Journal on Computing, 15 (3): 249-266.
117. Nauss, R.M. (2004) The elastic generalized assignment problem. Journal of the Operational Research Society, 55: 1333-1341.
118. Nemhauser, G.L., Savelsbergh, M.W.P., and Sigismondi, G.C. (1994) MINTO, a Mixed INTeger Optimizer. Operations Research Letters, 15: 47-58.
119. Nowakovski, J., Schwrzler, W., and Triesch, E. (1999) Using the generalized assignment problem in scheduling the ROSAT space telescope. European Journal of Operational Research, 112: 531-541.
120. Nutov, Z., Beniaminy, I., and Yuster, R. (2006) A (1-1/e) approximation algorithm for the generalized assignment problem. Operations Research Letters, 34 (3): 283-288.
121. Osman, I.H. (1995) Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches. OR Spektrum, 17: 211-225.
122. Osorio, M.A. and Laguna, M. (2003) Logic cuts for multilevel generalized assignment problems. European Journal of Operational Research, 151: 238-246.
123. Park, J.S., Lim, B.H., and Lee, Y. (1998) A Lagrangean dual-based branch-and-bound algorithm for the generalized multi-assignment problem. Management Science, 44 (12): 271-282.
124. Pigatti, A., de Aragao, M.P., and Uchoa, E. (2004) Stabilized branch-and-cut-and-price for the generalized assignment problem. Electronic Notes in Discrete Mathematics, 19: 389-395.
125. Pirkul, H. (1986) A integer programming model for the allocation of databases to a distributed computer system. European Journal of Operational Research, 26 (3): 401-411.
126. Privault, C. and Herault, L. (1998) Solving a real-world assignment problem with a metaheuristic. Journal of Heuristic, 4 (4): 383-398.
127. Racer, M. and Amini, M.M. (1994) A robust heuristic for the generalized assignment problem. Annals of Operations, 50: 487-503.
128. Romeijn, H.E. and Romero-Morales, D. (2001) Generating experimental data for the generalized assignment problem. Operations Research, 49 (6): 866-878.
129. Romeijn, H.E. and Romero-Morales, D. (2000) A class of greedy algorithms for the generalized assignment problem. Discrete Applied Mathematics, 103: 209-235.
130. Romeijn, H.E. and Piersma, N. (2000) A probabilistic feasibility and value analysis of the generalized assignment problem. Journal of Combinatorial Optimization, 4 (3): 325-355.
131. Romero-Morales, D. and Romeijn, H.E. (2005) The generalized assignement problem and extensions. In Handbook of Combinatorial Optimization; Du, D.-Z. and Pardalos, P.M. (eds.);, 259-313.
132. Ross, G.T. and Soland, R.M. (1975) A branch and bound approach for the generalized assignment problem. Mathematical Programming, 8: 91-105.
133. Ross, G.T. and Soland, R.M. (1977) Modeling facility location problems as generalized assignment problems. Management Science, 24: 345-357.
134. Ross, G.T. and Soland, R.M. (1980) A multicriteria approach to the location of public facilities. European Journal of Operational Research, 4 (5): 307-321.
135. Ross, G.T. and Zoltners, A.A. (1979) Weighted assignment models and their application. Management Science, 25 (7): 683-696.
136. Ruland, K.S. (1999) A model for aeromedical routing and scheduling. International Transactions in Operational Research, 87: 57-73.
137. Savelsbergh, M.W.P. (1997) A branch-and-price algorithm for the generalized assignment problem. Operations Research, 45: 831-841.
138. Sahni, S. and Gonzalez, T. (1976) P-complete approximation problems. Journal of the Association for Computing Machinery, 23: 555-565.
139. Scaparra, M.P., Pallottino, S., and Scutella, M.G. (2004) Large-scale local search heuristics for the capacitated vertex p-center problem. Networks, 43 (4): 241-255.
140. Shieh, H-M. and May, M-D. (2001) Solving the capacitated clustering problem with genetic algorithms. Journal of the Chinese Institute of Industrial Engineers, 18 (3): 1-12.
141. Shmoys, D.B. and Tardos, E. (1993) An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62 (3): 461-474.
142. Shtub, A. (1989) Modelling group technology cell formation as a generalized assignment problem. International Journal of Production Research, 27 (5): 775-782.
143. Shtub, A. and Kogan, K. (1998) Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP). European Journal of Operational Research, 105: 91-99.
144. Srinivasan, V. and Thompson, G.L. (1973) An algorithm for assigning uses to sources in a special class of transportation problems. Operations Research, 21: 284-295.
145. Toktas, B., Yen, J.W., and Zabinsky, Z.B. (2006) Addressing capacity uncertainty in resource-constrained assignment problems. Computers and Operations Research, 33 (3): 724-745.
146. Toktas, B. (2004) Addressing capacity uncertainty in resource-constrained assignment problems; Unpublished PhD dissertation. University of Washington Seattle.
147. Trick, M.A. (1992) A linear relaxation heuristic for the generalized assignment problem. Naval Research Logistics, 39: 137-152.
148. Wilson, J.M. (1997) A simple dual algorithm for the generalized assignment problem. Journal of Heuristics, 2 (4): 303-311.
149. Wilson, J.M. (1997) Genetic algorithm for the generalized assignment problem. Journal of the Operational Research Society, 48 (8): 804-809.
150. Wilson, J.M. (2005) An algorithm for the generalized assignment problem with special ordered sets. Journal of Heuristics, 11: 337-350.
151. Yagiura, M. and Ibaraki, T. (2004) Recent metaheuristic algorithms for the generalized assignment problem, International Conference in Informatics Research for Development of Knowledge Society Infrasructure (ICKS'04), 229-237, March 1-2, 2004, Kyoto, Japan.
152. Yagiura, M. and Ibaraki, T. (2007) Generalized Assignment Problem. In: Gonzale, T.F. (ed.). Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall/CRC in the Computer and Information Science Series, Chapter 48.
153. Yagiura, M., Ibaraki, T., and Glover, F. (2004) An ejection chain approach for the generalized assignment problem. INFORMS Journal on Computing, 16 (2): 133-151.
154. Yagiura, M., Ibaraki, T., and Glover, F. (2006) A path relinking approach with ejection chains for the generalized assignment problem. European Journal of Operational Research, 169 (2): 548-569.
155. Yagiura, M., Iwasaki, S., Ibaraki, T., and Glover, F. (2004b) A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discrete Optimization, 1: 87-98.
156. Yagiura, M., Yamaguchi, T., and Ibaraki, T. (1999) A variable depth search algorithm for the generalized assignment problem. In Metaheuristics: advances and trends in local search paradigms for optimization; Kluwer Academic Publisher Boston: MA, 459-471.
157. Yu, Y. and Prasanna, V.K. (2002) Power-aware resource allocation for independent tasks in homogeneous real-time systems, 9th International Conference on Parallel and Distributed Systems, p. 341, December 17-20, Taiwan ROC.
158. Yu, Y. and Prasanna, V.K. (2003) Resource allocation for independent real-time tasks in heterogeneous systems for energy minimization. Journal of Information Science and Engineering, 19 (3): 433-449.
159. Zhang, C-W. and Ong, H-L. (2007) An efficient solution to biobjective generalized assignment problem. Advances in Engineering Software, 38: 50-58.
160. Zimokha, V.A. and Rubinstein, M.I. (1988) R&D planning and the generalized assignment problem. Automation and Remote Control, 49: 484-492.