Korean Management Science Review (경영과학)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

A New Heuristic for the Generalized Assignment Problem

  • Joo, Jaehun (Department of Information Industry, Dongguk University)
  • Published : 1997.05.01
Download PDF
⟨ Previous Next ⟩

Abstract

The Generalized Assignment Problem(GAP) determines the minimum assignment of n tasks to m workstations such that each task is assigned to exactly one workstation, subject to the capacity of a workstation. In this paper, we presented a new heuristic search algorithm for GAPs. then we tested it on 4 different benchmark sample sets of random problems generated according to uniform distribution on a microcomputer.

Keywords

References

  1. Dongnam Journal of Managment v.10 A New Algorithm Based on the Enumeration for the Generalized Assignment Problem Joo,J.H.
  2. Journal of the Korean Operations Research and Management Science Society v.19 no.2 Improvements of Branch and Bound Algorithm for the Integer Generalized Network Problem Joo,J.H.;K.Kim
  3. dissertation, Department of Operations Research, Southern Methodist University Network Reoptimization Algorithm: A Computational Comparison of Algorithmic Alternatives Amini,M.M.
  4. ORSA J. on Computing v.5 no.4 Network Reoptimization Algorithms: A Statistical Designed Comparison Amini,M.M.;R.S.Barr
  5. Management Science v.40 no.7 A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem Amini,M.M.;M.Racer
  6. Working Paper 34-72-3 An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks Balachandran,V.
  7. Vehicle Routing: Methods and Studies Vehicle Routing with Backhauls: Models, Algorithms, and Case Studies Casco,D.O.;B.L.Golden;E.A.Wasil
  8. Networks v.11 A Generalized Assignment Heuristic for Vehicle Routing Fisher,M.L.;R.Jaikumar
  9. Management Science v.32 no.9 A Multiplier Adjustment Method for the Generalized Assignment Problem Fisher,M.L.;R.Jaikumar;L. N. Van Wassenhove
  10. Management Science v.20 no.5 Practical Solution of Large Mixed Integer Programming Problems with UMPIRE Forrest,J.J.;J.P.H.Hirst;J.A.Tomlin
  11. Operations Research v.26 no.5 Data Structures and Computer Science Techniques in Operations Research Fox,B.L.
  12. Management Science v.37 no.6 Algorithms for the Multi-Resource Generalized Assignement Problem Gavish,B.;H.Pirkul
  13. Interfaces v.20 no.4 Tabu Search: A Tutorial Glover,F.
  14. ORSA J. on Computing v.1 no.3 Tabu Search - Part Ⅰ Glover,F.
  15. ORSA J. on Computing v.2 no.1 Tabu search - Part Ⅱ Glover,F.
  16. Management Science v.24 no.12 Generalized Networks: A Fundamental Computer-Based Planning Tool Glover,F.;J.Hultz;D.Klingman;J.Stutz
  17. The Traveling Salesman Problem Empirical Analysis of Heuristics Golden,B.L.;W.R.Stewart;E.L.Lawer(et al.)(ed.)
  18. ORSA J. on Computing v.2 Computational Testing: Why, How, and How Much Greenberg,H.J.
  19. Presented at the Joint National Meeting of ORSA/TIMS Considerations in the Optimal Synthesis of Some Communication Networks Griogoriadis,M.D.;D.T.Tang;L.S.Woo
  20. Operations Research v.37 no.4 An Improved Dual Based Algorithm of the Generalized Assignment Problem Guignard,M.;M.B.Rosenwein
  21. Transportation Research v.23b Route Choice on Networks with Concave Costs and Exclusive Arcs Hall,R.W.
  22. Operational Research v.81 An Algorithm for the Generalized Assignment Problem Martello,S.;P.Toth;J.P.Brans(ed.)
  23. Annals of Discrete Mathmatics v.31 Linear assignment Problem Martello,S.;P.Toth
  24. Combinatorial Optimization: Algorithms and Complexity Papadimitriou,C.H.;K.Steiglitz
  25. Math. Programming v.8 A Branch and Bound Algorithm for the Generalized Assignment Problem Ross,G.T.;R.M.Soland
  26. ORSA J. on Computing v.2 no.1 Tabu Search Applied to the Quadratic Assiganment Problem Skorin-Kapov,J.