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

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

By Gupta J.N.D.   Hariri A.M.A.   Potts C.N.  

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

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

Tight bounds on the round complexity of distributed 1-solvable tasks

By M.S. Paterson   Biran O.   Moran S.   Zaks S.  

Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. : 271-290

Elsevier

Access to resources Recommend Favorite

A Complexity Analysis for Directional Parametric Height Field Ray Tracing

By Paglieroni D.W.  

Graphical Models and Image Processing, Vol. 61, Iss. 5, 1999-09 ,pp. : 299-321

Elsevier

Access to resources Recommend Favorite