Single-machine scheduling to minimize maximumtardiness with minimum number of tardy jobs

Author： Gupta J.N.D.   Hariri A.M.A.   Potts C.N.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.92, Iss.1, 1999-01, pp. : 107-123

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

An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling

By Dauzère-Pérès Stéphane   Sevaux Marc  

Journal of Scheduling, Vol. 7, Iss. 6, 2004-11 ,pp. : 405-420

Springer Publishing Company

Access to resources Recommend Favorite

One-machine scheduling to minimize mean tardiness with minimum number tardy

By Duffuaa S. O.   Raouf A.   Ben-Daya M.   Makki M.  

Production Planning and Control, Vol. 8, Iss. 3, 1997-04 ,pp. : 226-230

Taylor & Francis Ltd

Access to resources Recommend Favorite

Single machine scheduling with maximum earliness and number tardy

By Azizoglu M.   Kondakci S.   Koksalan M.  

Computers and Industrial Engineering, Vol. 45, Iss. 2, 2003-08 ,pp. : 257-268

Elsevier

Access to resources Recommend Favorite

Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs

By Crauwels H.   Potts C.   Oudheusden D.   Van Wassenhove L.  

Journal of Scheduling, Vol. 8, Iss. 2, 2005-04 ,pp. : 161-177

Springer Publishing Company

Access to resources Recommend Favorite

Decomposition in single-machine scheduling

By Szwarc W.  

Annals of Operations Research, Vol. 83, Iss. 1, 1998-01 ,pp. : 271-287

Springer Publishing Company

Access to resources Recommend Favorite