Generalized assignment problem

Handbook of Approximation Algorithms and Metaheuristics

Volumn , Issue , 2007, Pages 48-1-48-18

  Yagiura, Mutsunori ^a   Ibaraki, Toshihide ^b  

^a NAGOYA UNIVERSITY   (Japan)

^b KWANSEI GAKUIN UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85031430316     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420010749     Document Type: Chapter

References (50)

1. Mazzola, J. B., Neebe, A. W., and Dunn, C. V. R., Production planning of a flexible manufacturing system in a material requirements planning environment, Int. J. Flexible Manuf. Syst., 1/2, 115, 1989.
2. Ross, G. T. and Soland, R. M., Modeling facility location problems as generalized assignment problems, Manage. Sci., 24, 345, 1977.
3. Fisher, M. L. and Jaikumar, R., A generalized assignment heuristic for vehicle routing, Networks, 11, 109, 1981.
4. Martello, S. and Toth, P., An algorithm for the generalized assignment problem, in Proc. IFORS Int. Conf. Oper. Res., Brans, J. P., ed., North-Holland, Amsterdam, 1981, p. 589.
5. Martello, S. and Toth, P., Knapsack Problems: Algorithms and Computer Implementations, Wiley, Chichester, 1990.
6. Osman, I. H., Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches, OR Spektrum, 17, 211, 1995.
7. Chu, P. C. and Beasley, J. E., A genetic algorithm for the generalized assignment problem, Comput. Oper. Res., 24, 17, 1997.
8. Amini, M. M. and Racer, M., A hybrid heuristic for the generalized assignment problem, Eur. J. Oper. Res., 87, 343, 1995.
9. Racer, M. and Amini, M. M., A robust heuristic for the generalized assignment problem, Ann. Oper. Res., 50, 487, 1994.
10. Laguna, M., Kelly, J. P., González-Velarde, J. L., and Glover, F., Tabu search for the multilevel generalized assignment problem, Eur. J. Oper. Res., 82, 176, 1995.
11. Díaz, J. A. and Fernández, E., A tabu search heuristic for the generalized assignment problem, Eur. J. Oper. Res., 132, 22, 2001.
12. Haddadi, S. and Ouzia, H., An effective Lagrangian heuristic for the generalized assignment problem, INFOR, 39, 351, 2001.
13. Lourenço H. R. and Serra, D., Adaptive search heuristics for the generalized assignment problem, Mathware Soft Comput., 9, 209, 2002.
14. Alfandari, L., Plateau, A., and Tolla, P., A path relinking algorithm for the generalized assignment problem, in Metaheuristics: Computer Decision-Making, Resende, M. G.C., and de Sousa, J. P., Eds., Kluwer Academic Publishers, Boston, MA, 2003, p. 1.
15. Yagiura, M., Ibaraki, T., and Glover, F., An ejection chain approach for the generalized assignment problem, INFORMS J. Comput., 16, 133, 2004.
16. Yagiura, M., Ibaraki, T., and Glover, F., A path relinking approach with ejection chains for the generalized assignment problem, Eur. J. Oper. Res., 169, 548, 2006.
17. Ross, G.T. and Soland, R. M., Abranch and bound algorithm for the generalized assignment problem, Math. Prog., 8, 91, 1975.
18. Fisher, M. L., Jaikumar, R., and van Wassenhove, L. N., A multiplier adjustment method for the generalized assignment problem, Manage. Sci., 32, 1095, 1986.
19. Savelsbergh, M., A branch-and-price algorithm for the generalized assignment problem, Oper. Res., 45, 831, 1997.
20. Nauss, R. M., Solving the generalized assignment problem: An optimizing and heuristic approach, INFORMS J. on Comput., 15, 249, 2003.
21. Haddadi, S. and Ouzia, H., Effective algorithm and heuristic for the generalized assignment problem, Eur. J. Oper. Res., 153, 184, 2004.
22. Garey, M. R. and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NPCompleteness, Freeman, New York, 1979.
23. Chekuri, C. and Khanna, S., A polynomial time approximation scheme for the multiple knapsack problem, SIAM J. Comput., 35, 713, 2006.
24. Nutov, Z., Beniaminy, I., and Yuster, R., A (1 − 1/e)-approximation algorithm for the generalized assignment problem, Oper. Res. Lett., 34, 283, 2006.
25. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B., Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Upper Saddle River, NJ, 1993.
26. Korte, B. andVygen, J., Combinatorial Optimization: Theory and Algorithms, 3rd ed., Springer, Berlin, 2006.
27. Schrijiver, A., Combinatorial Optimization: Polyhedra and Efficiency, Springer, Berlin, 2003.
28. Cattrysse, D. G., Salomon, M., and van Wassenhove, L. N., A set partitioning heuristic for the generalized assignment problem, Eur. J. Oper. Res., 72, 167, 1994.
29. Gavish, B. and Pirkul, H., Algorithms for the multi-resource generalized assignment problem, Manage. Sci., 37, 695, 1991.
30. Rego, C., Sagbansua, L., Alidaee, B., and Glover, F., RAMPand Primal-dualRAMPAlgorithms for the Multi-Resource Generalized Assignment Problem, Research Report, Hearin Center for Enterprise Science, School of Business Administration, University of Mississippi, 2005.
31. Rego, C., RAMP: A new metaheuristic framework for combinatorial optimization, in Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, Rego, C. and Alidaee, S., Eds., Kluwer Academic Publishers, Dordrecht, 2005, p. 441.
32. Yagiura, M., Iwasaki, S., Ibaraki, T., and Glover, F., A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, Discrete Optimization, 1, 87, 2004.
33. Shtub, A. and Kogan, K., Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP), Eur. J. Oper. Res., 105, 91, 1998.
34. Park, J. S., Lim, B. H., and Lee, Y., A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem, Manage. Sci., 44, 271, 1998.
35. Privault, C. and Herault, L., Solving a real world assignment problem with a metaheuristic, J. Heuristics, 4, 383, 1998.
36. Cattrysse, D. G. and van Wassenhove, L. N., A survey of algorithms for the generalized assignment problem, Eur. J. Oper. Res., 60, 260, 1992.
37. Yagiura, M., Yamaguchi, T., and Ibaraki, T., A variable depth search algorithm with branching search for the generalized assignment problem, Optimization Meth. Software, 10, 419, 1998.
38. Yagiura, M., Yamaguchi, T., and Ibaraki, T., A variable depth search algorithm for the generalized assignment problem, in Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Voß, S., Martello, S., Osman, I. H., and Roucairol, C., Eds., Kluwer Academic Publishers, Boston, MA, 1999, p. 459.
39. Fisher, M. L., The Lagrangian relaxation method for solving integer programming problems, Manage. Sci., 27, 1, 1981.
40. Held, M. and Karp, R. M., The traveling salesman problem and minimum spanning trees: Part II, Math. Prog., 1, 6, 1971.
41. Martello, S., Pisinger, D., andToth, P., Dynamic programmingand strong bounds for the 0-1 knapsack problem, Management Sci., 45, 414, 1999.
42. Haddadi, S., Lagrangian decomposition based heuristic for the generalized assignment problem, INFOR, 37, 392, 1999.
43. Lorena, L. A. N. and Narciso, M. G., Relaxation heuristics for a generalized assignment problem, Eur. J. Oper. Res., 91, 600, 1996.
44. Narciso, M. G. and Lorena, L. A. N., Lagrangian/surrogate relaxation for generalized assignment problems, Eur. J. Oper. Res., 114, 165, 1999.
45. Glover, F., Ejection chains, reference structures and alternating path methods for traveling salesman problems, Discrete Appl. Math., 65, 223, 1996.
46. Nauss, R. M., The generalized assignment problem, in Integer Programming: Theory and Practice, Karlof, J. K., Ed., CRC Press, Boca Raton, FL, 2006, p. 39.
47. Nonobe, K. and Ibaraki, T., A tabu search approach to the CSP (constraint satisfaction problem) as a general problem solver, Eur. J. Oper. Res., 106, 599, 1998.
48. Lin, J.-H. and Vitter, J. S., ε-approximationswith minimumpacking constraint violation, Proc. STOC, 1992, p. 771.
49. Shmoys, D. B. and Tardos, É., An approximation algorithm for the generalized assignment problem, Math. Prog., 62, 461, 1993.
50. Lenstra, J. K., Shmoys, D. B., and Tardos, É., Approximation algorithms for scheduling unrelated parallel machines, Math. Prog., 46, 259, 1990.