Generalized Assignment Problem Dynamic Programming And Optimal Control

  • [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

  • Дэвид смотрел на нее и улыбался. - Ну и что ты скажешь, моя красавица. Выйдешь за меня замуж. Лежа в кровати с балдахином, она смотрела на него и знала, что ей нужен именно. Навсегда.

    0 comments

    Leave a Reply

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