B. Wagle
EJOR
A scheduling algorithm is proposed which is intended to minimize changes of tasks on processors and thereby reduce overhead. The algorithm also has application to more general resource allocation problems. It is implemented by means of a method for efficiently handling dynamically changing segmented lists. © 1970, ACM. All rights reserved.
B. Wagle
EJOR
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Daniel M. Bikel, Vittorio Castelli
ACL 2008