( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Scheduling subject to resource constraints: classification and complexity.

, , и . Discret. Appl. Math., 5 (1): 11-24 (1983)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

H -G Imhof

A G Class

Kan Jiang

H G Olaf Tautenhahn

Michael H G Becker

 

Другие публикации лиц с тем же именем

A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem., , и . Discret. Appl. Math., 42 (2): 279-290 (1993)Managing a multi-billion dollar IT Budget.. ICSM, стр. 2-. IEEE Computer Society, (2003)A General Bounding Scheme for the Permutation Flow-Shop Problem., , и . Operations Research, 26 (1): 53-67 (1978)Technical Note - On the Expected Performance of Branch-and-Bound Algorithms., и . Operations Research, 26 (2): 347-349 (1978)Complexity of Vehicle Routing Problem with Time Windows, и . Networks, (1981)A framework for the probabilistic analysis of hierarchical planning systems., , и . Ann. Oper. Res., 1 (1): 23-42 (1984)IT Governance and Corporate Governance at ING. Information Systems Control Journal, (2004)Author's Note: This article is based upon the transcript of the keynote presentation given by Dr. Alexander Rinnooy Kan at the ISACA EuroCACS Conference, Amsterdam, 24 March 2003. Assistance from John Spangenberg and Paul Williams of ING Corporate IT in the preparation of this article is gratefully acknowledged. A.H.G. Rinnooy Kan is a member of the executive board of Amsterdam-based ING Group, where, amongst other responsibilities, he has direct responsibility for information technology..Optimization and approximation in deterministic sequencing and scheduling: a survey, , , и . Annals of discrete mathematics, 5 (2): 287--326 (1979)Scheduling subject to resource constraints: classification and complexity., , и . Discret. Appl. Math., 5 (1): 11-24 (1983)Vehicle Routing with Time Windows., , и . Operations Research, 35 (2): 266-273 (1987)