Bicriteria approximation algorithms for scheduling problems with communications delays

Author： Bampis Evripidis Kononov Alexander

ISSN： 1094-6136

Source： Journal of Scheduling, Vol.8, Iss.4, 2005-07, pp. : 281-294

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

Approximation Algorithms for Scheduling with Reservations

By Diedrich Florian Jansen Klaus Pascual Fanny Trystram Denis

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 391-404

Springer Publishing Company

Access to resources Recommend Favorite

Meta-Heuristic Algorithms to Solve Bi-Criteria Parallel Machines Scheduling Problem

International Journal of Applied Evolutionary Computation (IJAEC), Vol. 7, Iss. 2, 2016-04 ,pp. : 76-96

IGI Global_journal

Access to resources Recommend Favorite

On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems

By Angel E. Bampis E. Kononov A.

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 319-338

Elsevier

Access to resources Recommend Favorite

Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays: Models and Algorithms for Planning and Scheduling Problems (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz)

By Brucker Peter

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

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