An Exact Algorithm for Variant Assignment Problem
Abstract
This paper address variant constrained job assignment model. To solve this problem we applied a method called Lexi-Search algorithm. Tests are conducted on randomly generated instances.
Keywords
Full Text:
PDFReferences
Balachandran, V.“An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Network,” Operations Research, 24, 1976, pp. 742-759.
Cattrysee, D.G. & Wassenhove, L.N.V. “A Survey of Algorithms for the Generalized Assignment Problems,” Euro.J.O.R. 60, 1992, pp.260-272.
Dakin, R. “A Tree Search Algorithm for Mixed Integer Programming Problems,” Computer Journal 8, 1965, pp. 250-255.
Devaio & Roved. “An All Zero-One Algorithm for A class of Transportation Problem,” Operations Research, 19, 1971, pp.1406-1418.
Fisher, M.L., Jaikumar, R. & Luk N.Van.Wassenhove., “A Multiplier Adjustment Method for the Generalized Assignment Problem,” Management Science, 32, 1986, pp.1095-1103.
Geoffrion, A.M., & Graves, G.W. “Multi Commodity Distribution System Design by Benders Decomposition,” Management Science, 20, 1974, pp.822-844.
Kuhn, H. “Variants of the Hungarian Method for Assignment Problems,” Naval Research Logistics, Qtrly., 3, 1956, pp.253-258.
Martello, S. & Toth, P. “An algorithm for the Generalized Assignment Problem,” in J.P.BRANS(ed.), Operations Research, 81,1981, North Holland, pp. 589-603.
Ross, G.T. & Soland, R.M. “A Branch and Bound Algorithm for Generalized Assignment Problem,” Mathematical Programming, 1975, pp.91-103.
Ross, G.T. & Soland, R.M. “Modelling Facility Location Problems as Generalized Assignment Problems,” Management Science, 24, 1977, pp.345-357.
Ravi Kumar, M. “Data Guided Algorithm in Combinatorial Optimization,” 1994, A Ph.D. Thesis, Osmania University, Hyderabad.
Sobhan Babu, K. & Sundara Murthy, M. “An efficient algorithm for Variant Bulk Transportation Problem” International Journal of Engineering Science and Technology, 2010, Vol.2, Issue 7, pp.2595-2600.
Srinivasan, V. & Thompson, G.L. “An Algorithm for Assigning uses to Sources in a special class of Transportation Problems,” Operations Research, 21, 1973, pp.284-295.
Sundara Murthy, M. “Combinatorial Programming: A Pattern Recognition Approach,” A Ph.D. Thesis, REC, Warangal. 1979.
Venkata Ramana, V.V. & Umasankar, C. “On a Class of Assignment Problems,” Opsearch, 1998, Vol.35, No.2. pp.127-138.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.