IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v60y1992i3p260-272.html
   My bibliography  Save this item

A survey of algorithms for the generalized assignment problem

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Christian Billing & Florian Jaehn & Thomas Wensing, 2020. "Fair task allocation problem," Annals of Operations Research, Springer, vol. 284(1), pages 131-146, January.
  2. Narciso, Marcelo G. & Lorena, Luiz Antonio N., 1999. "Lagrangean/surrogate relaxation for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 114(1), pages 165-177, April.
  3. Drexl, Andreas & Salewski, Frank, 1997. "Distribution requirements and compactness constraints in school timetabling," European Journal of Operational Research, Elsevier, vol. 102(1), pages 193-214, October.
  4. Sujeet Kumar Singh & Deepika Rani, 2019. "A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem," OPSEARCH, Springer;Operational Research Society of India, vol. 56(3), pages 1007-1023, September.
  5. Andreas Kleine & Andreas Dellnitz, 2017. "Allocation of seminar applicants," Journal of Business Economics, Springer, vol. 87(7), pages 927-941, October.
  6. Jafar Rezaei & Negin Salimi, 2015. "Optimal ABC inventory classification using interval programming," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(11), pages 1944-1952, August.
  7. Helena Ramalhinho-Lourenço & Daniel Serra, 1998. "Adaptive approach heuristics for the generalized assignment problem," Economics Working Papers 288, Department of Economics and Business, Universitat Pompeu Fabra.
  8. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.
  9. Bahram Alidaee & Haibo Wang & Jun Huang & Lutfu S. Sua, 2023. "Integrating Statistical Simulation and Optimization for Redundancy Allocation in Smart Grid Infrastructure," Energies, MDPI, vol. 17(1), pages 1-13, December.
  10. Franck Butelle & Laurent Alfandari & Camille Coti & Lucian Finta & Lucas Létocart & Gérard Plateau & Frédéric Roupin & Antoine Rozenknop & Roberto Wolfler Calvo, 2016. "Fast machine reassignment," Annals of Operations Research, Springer, vol. 242(1), pages 133-160, July.
  11. Maria Albareda-Sambola & Elena Fernández, 2000. "The stochastic generalised assignment problem with Bernoulli demands," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 8(2), pages 165-190, December.
  12. Amini, Mohammad M. & Racer, Michael, 1995. "A hybrid heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 87(2), pages 343-348, December.
  13. Gerard M. Campbell, 1999. "Cross-Utilization of Workers Whose Capabilities Differ," Management Science, INFORMS, vol. 45(5), pages 722-732, May.
  14. Albareda-Sambola, Maria & Vlerk, Maarten H. van der & Fernandez, Elena, 2002. "Exact solutions to a class of stochastic generalized assignment problems," Research Report 02A11, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  15. Majumdar, J. & Bhunia, A.K., 2007. "Elitist genetic algorithm for assignment problem with imprecise goal," European Journal of Operational Research, Elsevier, vol. 177(2), pages 684-692, March.
  16. Nonobe, Koji & Ibaraki, Toshihide, 1998. "A tabu search approach to the constraint satisfaction problem as a general problem solver," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 599-623, April.
  17. Casas-Ramírez, Martha-Selene & Camacho-Vallejo, José-Fernando & Martínez-Salazar, Iris-Abril, 2018. "Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences," Applied Mathematics and Computation, Elsevier, vol. 319(C), pages 369-386.
  18. Kim, Jung-Ug & Kim, Yeong-Dae, 1999. "A decomposition approach to a multi-period vehicle scheduling problem," Omega, Elsevier, vol. 27(4), pages 421-430, August.
  19. Campbell, Gerard M. & Diaby, Moustapha, 2002. "Development and evaluation of an assignment heuristic for allocating cross-trained workers," European Journal of Operational Research, Elsevier, vol. 138(1), pages 9-20, April.
  20. Krumke, Sven O. & Thielen, Clemens, 2013. "The generalized assignment problem with minimum quantities," European Journal of Operational Research, Elsevier, vol. 228(1), pages 46-55.
  21. M. Gaudioso & L. Moccia & M. F. Monaco, 2010. "Repulsive Assignment Problem," Journal of Optimization Theory and Applications, Springer, vol. 144(2), pages 255-273, February.
  22. Brandimarte, Paolo, 1999. "Exploiting process plan flexibility in production scheduling: A multi-objective approach," European Journal of Operational Research, Elsevier, vol. 114(1), pages 59-71, April.
  23. Ahmed Ghoniem & Tulay Flamand & Mohamed Haouari, 2016. "Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 575-588, August.
  24. Diaz, Juan A. & Fernandez, Elena, 2001. "A Tabu search heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 132(1), pages 22-38, July.
  25. Liles, Joseph M. & Robbins, Matthew J. & Lunday, Brian J., 2023. "Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1435-1449.
  26. Matusiak, M. & de Koster, M.B.M. & Saarinen, J., 2015. "Data-driven warehouse optimization," ERIM Report Series Research in Management ERS-2015-008-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
  27. Holzapfel, Andreas & Potoczki, Tobias & Kuhn, Heinrich, 2023. "Designing the breadth and depth of distribution networks in the retail trade," International Journal of Production Economics, Elsevier, vol. 257(C).
  28. Konrad, Renata A. & Trapp, Andrew C. & Palmbach, Timothy M. & Blom, Jeffrey S., 2017. "Overcoming human trafficking via operations research and analytics: Opportunities for methods, models, and applications," European Journal of Operational Research, Elsevier, vol. 259(2), pages 733-745.
  29. Albareda-Sambola, Maria & van der Vlerk, Maarten H. & Fernandez, Elena, 2006. "Exact solutions to a class of stochastic generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 173(2), pages 465-487, September.
  30. Holzapfel, Andreas & Kuhn, Heinrich & Sternbeck, Michael G., 2018. "Product allocation to different types of distribution center in retail logistics networks," European Journal of Operational Research, Elsevier, vol. 264(3), pages 948-966.
  31. repec:dgr:rugsom:02a11 is not listed on IDEAS
  32. Hertz, Alain & Robert, Vincent, 1998. "Constructing a course schedule by solving a series of assignment type problems," European Journal of Operational Research, Elsevier, vol. 108(3), pages 585-603, August.
  33. Richard Freling & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2003. "A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem," Operations Research, INFORMS, vol. 51(6), pages 922-939, December.
  34. Gerçek Budak & İmdat Kara & Yusuf Tansel İç & Refail Kasımbeyli, 2019. "New mathematical models for team formation of sports clubs before the match," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(1), pages 93-109, March.
  35. Jeet, V. & Kutanoglu, E., 2007. "Lagrangian relaxation guided problem space search heuristics for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1039-1056, November.
  36. Pessoa, Artur Alves & Hahn, Peter M. & Guignard, Monique & Zhu, Yi-Rong, 2010. "Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique," European Journal of Operational Research, Elsevier, vol. 206(1), pages 54-63, October.
  37. Robert M. Nauss, 2003. "Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 249-266, August.
  38. Imai, Akio & Nishimura, Etsuko & Current, John, 2007. "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, Elsevier, vol. 176(1), pages 87-105, January.
  39. Haddadi, Salim & Ouzia, Hacene, 2004. "Effective algorithm and heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 153(1), pages 184-190, February.
  40. Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, August.
  41. Gavish, Bezalel, 1997. "Low earth orbit satellite based communication systems -- Research opportunities," European Journal of Operational Research, Elsevier, vol. 99(1), pages 166-179, May.
  42. Ahmed Ghoniem & Tulay Flamand & Mohamed Haouari, 2016. "Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 589-602, August.
  43. Zheng, Feifeng & Cheng, Yongxi & Xu, Yinfeng & Liu, Ming, 2013. "Competitive strategies for an online generalized assignment problem with a service consecution constraint," European Journal of Operational Research, Elsevier, vol. 229(1), pages 59-66.
  44. Matusiak, Marek & de Koster, René & Saarinen, Jari, 2017. "Utilizing individual picker skills to improve order batching in a warehouse," European Journal of Operational Research, Elsevier, vol. 263(3), pages 888-899.
  45. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2009. "On solving the Lagrangian dual of integer programs via an incremental approach," Computational Optimization and Applications, Springer, vol. 44(1), pages 117-138, October.
  46. R M Nauss, 2004. "The elastic generalized assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1333-1341, December.
  47. Taaffe, Kevin & Geunes, Joseph & Edwin Romeijn, H., 2010. "Supply capacity acquisition and allocation with uncertain customer demands," European Journal of Operational Research, Elsevier, vol. 204(2), pages 263-273, July.
  48. H. Edwin Romeijn & Dolores Romero Morales, 2001. "Generating Experimental Data for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 49(6), pages 866-878, December.
  49. Barbas, Javier & Marin, Angel, 2004. "Maximal covering code multiplexing access telecommunication networks," European Journal of Operational Research, Elsevier, vol. 159(1), pages 219-238, November.
  50. Lorena, Luiz Antonio N. & Narciso, Marcelo G., 1996. "Relaxation heuristics for a generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 91(3), pages 600-610, June.
  51. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
  52. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  53. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
  54. Raghavan, S. & Sahin, Mustafa & Salman, F. Sibel, 2019. "The capacitated mobile facility location problem," European Journal of Operational Research, Elsevier, vol. 277(2), pages 507-520.
  55. Saif Benjaafar & Mohsen ElHafsi & Francis de Véricourt, 2004. "Demand Allocation in Multiple-Product, Multiple-Facility, Make-to-Stock Systems," Management Science, INFORMS, vol. 50(10), pages 1431-1448, October.
  56. Norina Szander & Lorenzo Ros-McDonnell & María Victoria De-la-Fuente-Aragón & Robert Vodopivec, 2018. "Sustainable Urban Homecare Delivery with Different Means of Transport," Sustainability, MDPI, vol. 10(2), pages 1-12, February.
  57. Zhou, Gengui & Min, Hokey & Gen, Mitsuo, 2003. "A genetic algorithm approach to the bi-criteria allocation of customers to warehouses," International Journal of Production Economics, Elsevier, vol. 86(1), pages 35-45, October.
  58. Sana Bouajaja & Najoua Dridi, 2017. "A survey on human resource allocation problem and its applications," Operational Research, Springer, vol. 17(2), pages 339-369, July.
  59. T Shima & C Schumacher, 2009. "Assigning cooperating UAVs to simultaneous tasks on consecutive targets using genetic algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 973-982, July.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.