Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds

Author： Chudak F.A.   Shmoys D.B.  

Publisher： Academic Press

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.30, Iss.2, 1999-02, pp. : 323-343

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

Heuristic and Exact Algorithms for the Precedence-Constrained Knapsack Problem

By Samphaiboon N.   Yamada Y.  

Journal of Optimization Theory and Applications, Vol. 105, Iss. 3, 2000-06 ,pp. : 659-676

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Time Constrained Scheduling

By Jansen K.   Ohring S.  

Information and Computation, Vol. 132, Iss. 2, 1997-02 ,pp. : 85-108

Academic Press

Access to resources Recommend Favorite

Algorithms with limited number of preemptions for scheduling on parallel machines

By Jiang Yiwei   Weng Zewei   Hu Jueliang  

Journal of Combinatorial Optimization, Vol. 27, Iss. 4, 2014-05 ,pp. : 711-723

Springer Publishing Company

Access to resources Recommend Favorite

Online LPT algorithms for parallel machines scheduling with a single server

By Su Chunjie  

Journal of Combinatorial Optimization, Vol. 26, Iss. 3, 2013-10 ,pp. : 480-488

Springer Publishing Company

Access to resources Recommend Favorite

New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP

By Mak Vicky  

Mathematical Methods of Operations Research, Vol. 66, Iss. 1, 2007-08 ,pp. : 69-98

Springer Publishing Company

Access to resources Recommend Favorite