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

ISSN： 0254-5330

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

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

On-line scheduling of scalable real-time tasks on multiprocessor systems

By Lee W.Y. Hong S.J. Kim J.

Journal of Parallel and Distributed Computing, Vol. 63, Iss. 12, 2003-12 ,pp. : 1315-1324

Elsevier

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

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

Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines

By He Yong Jiang Yiwei

Acta Informatica, Vol. 40, Iss. 5, 2004-03 ,pp. : 367-383

Springer Publishing Company

Access to resources Recommend Favorite

The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks

By Angelelli E. Nagy Á.B. Speranza M.G. Tuza Zs.

Journal of Scheduling, Vol. 7, Iss. 6, 2004-11 ,pp. : 421-428

Springer Publishing Company

Access to resources Recommend Favorite