Approximation Algorithms for Time Constrained Scheduling

ISSN： 0890-5401

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

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 Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds

By Chudak F.A. Shmoys D.B.

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

Academic Press

Access to resources Recommend Favorite

Approximation algorithms for two-machine flow shop scheduling with batch setup times

By Chen B. Potts C.N. Strusevich V.A.

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 255-271

Elsevier

Access to resources Recommend Favorite

A dynamic edge covering and scheduling problem: complexity results and approximation algorithms

By Qiu Jiaming Sharkey Thomas

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1201-1212

Springer Publishing Company

Access to resources Recommend Favorite

Moderately exponential time and fixed parameter approximation algorithms

By Escoffier Bruno Paschos Vangelis Th. Tourniaire Emeric

Optimization, Vol. 62, Iss. 8, 2013-08 ,pp. : 1019-1036

Taylor & Francis Ltd

Access to resources Recommend Favorite

Smooth velocity approximation for constrained systems in real-time simulation

By Burgermeister Bernhard

Multibody System Dynamics, Vol. 26, Iss. 1, 2011-06 ,pp. : 1-14

Springer Publishing Company

Access to resources Recommend Favorite