Online Generalized Assignment Problem In Operations

  • [1]

    F.S. Hillier and G.J. Lieberman, Operations Research, 3rd ed., Holden-Day, 1980.Google Scholar

  • [2]

    G.T. Ross and R.M. Soland, A branch and bound algorithm for the Generalized Assignment Problem, Math. Programming 8(1975)91.Google Scholar

  • [3]

    R.M. Nauss, An efficient algorithm for the 0–1 knapsack problem, Management Science 23 (1976)27.Google Scholar

  • [4]

    S. Martello and P. Toth, An upper bound for the zero–one knapsack problem and branch and bound algorithm, European Journal of Operations Research 1(1977)168.Google Scholar

  • [5]

    T.D. Klastorin, An effective subgradient algorithm for the Generalized Assignment Problem, Computers and Operations Research 6(1979)155.Google Scholar

  • [6]

    E. Balas and E. Zemel, An algorithm for large zero–one knapsack problems, Operations Research 28(1980)1130.Google Scholar

  • [7]

    A. Shtub, L.J. LeBlanc and C. Ziyong, Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and pair-wise swap algorithms, European Journal of Operational Research (to appear).Google Scholar

  • [8]

    J.G. Kimemia and S.B. Gershwin, An algorithm for the computer control of a flexible manufacturing system, IEE Transactions 15(1983)353.Google Scholar

  • [9]

    E. Khmelnisky, K. Kogan and O. Maimon, A maximum principle based method for scheduling in a flexible manufacturing system, Discrete Events Dynamic Systems 5(1985)343.Google Scholar

  • [10]

    J.B. Sousa and F.L. Pereira, A hierarchical framework for the optimal flow control in manufacturing systems, in: Proceedings of the 3rd International Conference on Computer Integrated Manufacturing, IEEE Computer Society Press, Los Alamitos, 1992, p. 278.Google Scholar

  • Amini, M.M. and M. Racer. (1994). “A Rigorous Comparison of Alternative Solution Methods for the Generalized Assignment Problem.” Management Science 40, 868–890.Google Scholar

  • Beale, E.M.L. and J.J.H. Forrest. (1976). “Global Optimization Using Special Ordered Sets.” Mathematical Programming 10, 52–69.CrossRefGoogle Scholar

  • Beasley, J.E. (1990). “OR-Library: Distributing Test Problems by Electronic Mail. ” Journal of the Operational Research Society 41, 1069–1072.Google Scholar

  • Beale, E.M.L. and J.A. Tomlin. (1970). “Special Facilities in a General Mathematical Programming System for Non-Convex Problems Using Ordered Sets of Variables.” In J. Lawrence (ed.), OR 69: Proceedings of the Fifth International Conference on Operational Research, Venice 1969. London: Tavistock Publications, pp. 447–454.Google Scholar

  • Cattrysse, D., Z. Degraeve, and J. Tistaert. (1998). “Solving the Generalized Assignment Problem Using Polyhedral Results.” European Journal of Operational Research 108, 618–628.CrossRefGoogle Scholar

  • Chu, P.C. and J.E. Beasley. (1997). “A Genetic Algorithm for the Generalized Assignment Problem.” Computers and Operations Research 24, 260–272.CrossRefGoogle Scholar

  • de Farias Jr, I.R., E.L. Johnson, and G.L. Nemhauser. (2000). “A Generalized Assigment Problem with Special Odered Sets: A Polyhedral Approach.” Mathematical Programming 89, 187–203.Google Scholar

  • Diaz, J.A. and E. Fernandez. (2001). “A Tabu Search Heuristic for the Generalized Assignment Problem.” European Journal of Operational Research132, 22–38.CrossRefMathSciNetGoogle Scholar

  • M.L. Fisher, R. Jaikamur, and L.N. Van Wassenhove. (1986). “A Multiplier Adjustment Method for the Generalized Assignment Problem.” Management Science 32, 1095–1103.Google Scholar

  • Guignard, M.M. and M.B. Rosenwein. (1989). “An Improved Dual Based Algorithm for the Generalized Assignment Problem.” Operations Research 37, 658–663.Google Scholar

  • Higgins, A.J. (2001). “A Dynamic Tabu Search for Large-Scale Generalised Assignment Problems.” Computers and Operations Research 28, 1039–1048.CrossRefMathSciNetGoogle Scholar

  • Laguna, M., J. Kelly, J. Gonzalez-Velarde, and F. Glover. (1995). “Tabu Search for the Multilevel Generalized Assignment Problem.” EuropeanJournal of Operational Research 82, 176–189.CrossRefGoogle Scholar

  • Lorena, L.A.N. and M.G. Narcisco. (1996). “Relaxation Heuristics for a Generalized Assignment Problem.” European Journal of Operational Research 91, 600–610.CrossRefGoogle Scholar

  • Martello, S. and P. Toth. (1990). Knapsack Problems: Algorithms and Computer implementations. Chichester, England: John Wiley and Sons.Google Scholar

  • Nauss, R.M. (2003) “Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach.” INFORMS Journal on Computing 15, 249–266.CrossRefGoogle Scholar

  • Osman, I.H. (1995). “Heuristics for the Generalised Assignment Problem: Simulated Annealing and Tabu Search Approaches.” OR Spektrum 17, 211–225.CrossRefGoogle Scholar

  • Ross, G.T. and R.M. Soland. (1975). “A Branch and Bound Algorithm for the Generalized Assignment Problem.” Mathematical Programming 8, 91–103.CrossRefGoogle Scholar

  • Savelsbergh, M. (1997). “A Branch-and-Price Algorithm for the Generalized Assignment Problem.” Operations Research 45, 831–841.Google Scholar

  • Shmoys, D and E. Tardos. (1993). “An Approximation Algorithm for the Generalized Assignment Problem.” Mathematical Programming 62, 461–474.CrossRefGoogle Scholar

  • Trick, M.A. (1992). “A Linear Relaxation Heuristic for the Generalised Assignment Problem.” Naval Research Logistics 39, 137–151.MathSciNetGoogle Scholar

  • Wilson, J.M. (1997a). “A Genetic Algorithm for the Generalised Assignment Problem.” Journal of the Operational Research Society 48, 804–809.CrossRefGoogle Scholar

  • Wilson, J.M. (1997b). “A Simple Dual Algorithm for the Generalised Assignment Problem. ” Journal of Heuristics 2, 303–311.CrossRefGoogle Scholar

  • Yagiura, M, T Yamaguchi, and T. Ibaraki. (1998). “A Variable Depth Search Algorithm with Branching Search for the Generalized Assignment Problem.” Optimization Methods and Software 10, 419–441.Google Scholar

  • Yagiura, M, T. Ibaraki, and F. Glover. (2002). “A Path Relinking Approach for the Generalized Assignment Problem.” In Proceedings of the International Symposium on Scheduling, Japan, June 4–6, 2002, pp. 105–108.Google Scholar

  • Yagiura, M, T. Ibaraki, and F. Glover. (2004). “An Ejection Chain Approach for the Generalized Assignment Problem.” INFORMS Journal on Computing 16, 133–151.CrossRefMathSciNetGoogle Scholar

  • 0 comments

    Leave a Reply

    Your email address will not be published. Required fields are marked *