On Scheduling with Ready Times to Minimize Mean Flow Time | Zendy

Jitender S. Deogun | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On Scheduling with Ready Times to Minimize Mean Flow Time

Author(s) -

Jitender S. Deogun

Publication year - 1983

Publication title -

the computer journal

Language(s) - French

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/26.4.320

Subject(s) - computer science , scheduling (production processes) , mathematical optimization , flow (mathematics) , parallel computing , branch and bound , scheme (mathematics) , maximum flow problem , algorithm , mathematics , mathematical analysis , geometry

Un algorithme de mise en sequence de travaux dans un processeur simple avec pour objectif de minimiser le temps de flux moyen, quand les travaux ont des prises de temps inegaux, est developpe. La procedure entraine un partage du probleme en sous-problemes, et la resolution des sous-problemes en appliquant les techniques de Branch et Bound

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research