Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

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

Publisher： Springer Publishing Company

ISSN： 0178-4617

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

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

Related content

Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays

By Sevastyanov S. Sitters R. Fishkin A.

Automation and Remote Control, Vol. 71, Iss. 10, 2010-10 ,pp. : 2093-2101

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

On-line approximation algorithms for scheduling tasks on identical machines withextendable working time

By Speranza M.G. Tuza Z.

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 491-506

Springer Publishing Company

Access to resources Recommend Favorite

A LISTFIT heuristic for minimizing makespan on identical parallel machines

By Gupta J. N. D. Ruiz-Torres A. J.

Production Planning and Control, Vol. 12, Iss. 1, 2001-01 ,pp. : 28-36

Taylor & Francis Ltd

Access to resources Recommend Favorite

A LISFIT heuristic for minimizing makespan on identical parallel machines

By Gupta J. N. D. Ruiz-Torres A. J.

Production Planning and Control, Vol. 12, Iss. 3, 2001-04 ,pp. : 309-309

Taylor & Francis Ltd

Access to resources Recommend Favorite

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