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

Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan: Models and Algorithms for Planning and Scheduling Problems (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz)

By Błażewicz Jacek   Machowiak Maciej   Węglarz Jan   Kovalyov Mikhail Y.   Trystram Denis  

Annals of Operations Research, Vol. 129, Iss. 1-4, 2004-07 ,pp. : 65-80

Springer Publishing Company

Access to resources Recommend Favorite

Scheduling Tasks with Small Communication Delays for Clusters of Processors: Models and Algorithms for Planning and Scheduling Problems (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz)

By Bampis E.  

Annals of Operations Research, Vol. 129, Iss. 1-4, 2004-07 ,pp. : 47-63

Springer Publishing Company

Access to resources Recommend Favorite

On the number of nodes in universal networks of evolutionary processors

By Alhazov Artiom   Martín-Vide Carlos   Rogozhin Yurii  

Acta Informatica, Vol. 43, Iss. 5, 2006-12 ,pp. : 331-339

Springer Publishing Company

Access to resources Recommend Favorite