Related content

Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling

By Erickson Jeremy   Anderson James   Ward Bryan  

Real-Time Systems, Vol. 50, Iss. 1, 2014-01 ,pp. : 5-47

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine

By Tanaka K.   Vlach M.  

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 507-526

Springer Publishing Company

Access to resources Recommend Favorite

Heuristics for minimizing total completion time and maximum lateness on identical parallel machines with setup times

By Sabouni M.   Jolai F.   Mansouri A.  

Journal of Intelligent Manufacturing, Vol. 21, Iss. 4, 2010-08 ,pp. : 439-449

Springer Publishing Company

Access to resources Recommend Favorite

Optimal Algorithms for All-to-All Personalized Communication on Rings and Two Dimensional Tori

By Lam C.C.   Huang C.-.H.   Sadayappan P.  

Journal of Parallel and Distributed Computing, Vol. 43, Iss. 1, 1997-05 ,pp. : 3-13

Academic Press

Access to resources Recommend Favorite

Simple On-Line Algorithms for the Maximum Disjoint Paths Problem

By Kolman Petr   Scheideler Christian  

Algorithmica, Vol. 39, Iss. 3, 2004-04 ,pp. : 209-233

Springer Publishing Company

Access to resources Recommend Favorite