An Almost Optimal Heuristic for Preemptive C max Scheduling of Dependent Tasks on Parallel Identical Machines: Models and Algorithms for Planning and Scheduling Problems (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz)

By Józefowska Joanna  

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

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

By Epsteinthanks{School of Computer Science   The Interdisciplinary Center   Herzliya   Israel. lea@idc.ac.il. Leah   Sgall Jiri  

Algorithmica, Vol. 39, Iss. 1, 2004-01 ,pp. : 43-57

Springer Publishing Company

Access to resources Recommend Favorite

Scheduling linearly deteriorating jobs on parallel machines: a simulated annealing approach

By Hindi K. S.   Mhlanga S.  

Production Planning and Control, Vol. 12, Iss. 1, 2001-01 ,pp. : 76-80

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling unit length jobs on parallel machines with lookahead information

By Mandelbaum Marvin   Shabtay Dvir  

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 335-350

Springer Publishing Company

Access to resources Recommend Favorite

Robust scheduling of moldable parallel jobs

By Srinivasan Sudha   Krishnamoorthy Savitha   Sadayappan P.  

International Journal of High Performance Computing and Networking, Vol. 2, Iss. 2-3, 2006-02 ,pp. : 120-132

Inderscience Publishers

Access to resources Recommend Favorite