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

Author： Erickson Jeremy   Anderson James   Ward Bryan  

Publisher： Springer Publishing Company

ISSN： 0922-6443

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Single machine scheduling with batch set-up times to minimize maximum lateness

By Hariri A.M.A.   Potts C.N.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 75-92

Springer Publishing Company

Access to resources Recommend Favorite

An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness

By Zinder Y.   Roper D.  

Annals of Operations Research, Vol. 81, Iss. 1, 1998-01 ,pp. : 321-343

Springer Publishing Company

Access to resources Recommend Favorite

Generalization of EDF and LLF: Identifying All Optimal Online Algorithms for Minimizing Maximum Lateness

By Uthaisombut Patchrawat  

Algorithmica, Vol. 50, Iss. 3, 2008-03 ,pp. : 312-328

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

Partitioned EDF scheduling: a closer look

By Baruah Sanjoy  

Real-Time Systems, Vol. 49, Iss. 6, 2013-11 ,pp. : 715-729

Springer Publishing Company

Access to resources Recommend Favorite