Open AccessMinimizing total flow time and total completion time with immediate dispatching
Author(s) -
Nir Avrahami,
Yossi Azar
Publication year - 2003
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/777413.777415
Subject(s) - preemption , computer science , interrupt , queue , logarithm , scheduling (production processes) , maximum flow problem , online algorithm , distributed computing , time complexity , execution time , time constraint , real time computing , mathematical optimization , algorithm , computer network , operating system , embedded system , mathematics , mathematical analysis , political science , law , microcontroller
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom