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

ISSN： 0254-5330

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

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

Abstract

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

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

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

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

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