A statistical study of the performance of a task scheduling algorithmBASHIR, A. F; SUSARLA, V; VAIRAVAN, K et al.IEEE transactions on computers. 1983, Vol 32, Num 8, pp 774-777, issn 0018-9340Article

Méthodes d'ordonnancement pour la réalisation d'un ensemble de tâches dans un système de calcul multiprocesseur du type PS-3000MALIKYAN, A. L.Avtomatika i telemehanika. 1983, Num 12, pp 148-160, issn 0005-2310Article

On-line load balancing of temporary tasksAZAR, Y; KALYANASUNDARAM, B; PLOTKIN, S et al.Journal of algorithms (Print). 1997, Vol 22, Num 1, pp 93-110, issn 0196-6774Article

Heuristic algorithms for task assignment and scheduling in a processor networkSHEN SHEN WU; SWEETING, D.Parallel computing. 1994, Vol 20, Num 1, pp 1-14, issn 0167-8191Article

Robust scheduler for grid networks under uncertainties of both application demands and resource availabilityBATISTA, Daniel M; DA FONSECA, Nelson L. S.Computer networks (1999). 2011, Vol 55, Num 1, pp 3-19, issn 1389-1286, 17 p.Article

The Hyperdimensional Tar PitKAMP, Poul-Henning.Communications of the ACM. 2012, Vol 55, Num 3, pp 52-53, issn 0001-0782, 2 p.Article

Optimisation du temps de réponse par attribution de priorités aux tâches = Response time optimisation by task priority allocationVILLEN-ALTAMIRANO, M.Revue des Télécommunications. 1988, Vol 62, Num 3-4, pp 280-287, issn 0373-8582Article

First fit decreasing scheduling on uniform multiprocessorsKUNDE, M; STEPPAT, H.Discrete applied mathematics. 1985, Vol 10, Num 2, pp 165-177, issn 0166-218XArticle

Preemptive scheduling to minimize maximum completion time on uniform processors with memory constraintsMARTEL, C.Operations research. 1985, Vol 33, Num 6, pp 1360-1380, issn 0030-364XArticle

Architecture du logiciel du testeur de la procédure X21 = Architecture of software for testing the X21 procedureCHOI, Y; DEBESSON, P.1984, 20 p.Report

The importance of centralities in dark network value chainsTOTH, Noemi; GULYAS, László; LEGENDI, Richard O et al.The European physical journal. Special topics. 2013, Vol 222, Num 6, pp 1413-1439, issn 1951-6355, 27 p.Article

Fixed cycle scheduling : a solvable problem with empty precedence structureGARFINKEL, R. S; PLOTNICKI, W. J; PLOTNICKI et al.Operations research. 1990, Vol 38, Num 4, pp 629-633, issn 0030-364XArticle

Traitement multitâches et automates multifonctions = Multitask processing and multifunction programmable controllersAUCEL, J. C.Mesures (1983). 1986, Vol 51, Num 9, pp 35-40, issn 0755-219X, 4 p.Article

Sur la complexité de l'établissement de l'ordonnancement d'un système arbitraireTIMKOVSKIJ, V. G.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 3, pp 102-109, issn 0002-3388Article

Choix de la discipline d'ordonnancement d'après un critère minimaxKATS, B. A; KATS, R. A; SHVIDKAYA, G. D et al.Avtomatika i telemehanika. 1984, Num 6, pp 70-77, issn 0005-2310Article

Intelligent Methodologies for Scientific Conference ManagementBIBA, Marenglen; FERILLI, Stefano; DI MAURO, Nicola et al.Lecture notes in computer science. 2006, pp 258-267, issn 0302-9743, isbn 3-540-45764-X, 1Vol, 10 p.Conference Paper

Performance of Coffman-Graham schedules in the presence of unit communication delaysHANEN, C; MUNIER, A.Discrete applied mathematics. 1998, Vol 81, Num 1-3, pp 93-108, issn 0166-218XArticle

Algorithmique pour le parallélisme : Certains problèmes d'ordonnancement de tâches et Algorithmes de Couplage = Algorithmic for the parallelism : some problems of task organization and coupling algorithmsGiannakos, Aristotelis; König, Jean-Claude.1997, 122 p.Thesis

Task splitting for three machine preemptive schedulingPICKERING, D; STONE, M. G.Order (Dordrecht). 1991, Vol 7, Num 4, pp 349-352, issn 0167-8094, 4 p.Article

Efficacité des algorithmes approchés de répartition des programmes dans un système de calcul homogèneBAKENROT, V. YU; CHEFRANOV, A. G.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 4, pp 135-148, issn 0002-3388Article

A stochastic optimization algorithm minimizing expected flow times on uniform processorsAGRAWALA, A. K; COFFMAN, E. G. JR; GAREY, M. R et al.IEEE transactions on computers. 1984, Vol 33, Num 4, pp 351-356, issn 0018-9340Article

Distribution optimale des tâches de calcul et des bases de données dans un réseau d'ordinateursTONIEV, K. S; TSVIRKUN, A. D.Avtomatika i telemehanika. 1983, Num 12, pp 122-133, issn 0005-2310Article

Choosing task periods to minimise system utilisation in time triggered systemsBURNS, A; DAVIS, R.Information processing letters. 1996, Vol 58, Num 5, pp 223-229, issn 0020-0190Article

Système optimal de calculs mutuels dans les réseaux de centres de calculsLITVINCHEV, I. S; EHJVAZOV, A. R.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1984, Num 3, pp 64-67, issn 0002-3388Article

Allocating computer resources to satisfy user and management demandsPOSCH, R; HARING, G.Software, practice & experience. 1984, Vol 14, Num 4, pp 311-321, issn 0038-0644Article