Scheduling Theory. Single-Stage Systems
Latest Publications

TOTAL DOCUMENTS

5

(FIVE YEARS 0)

H-INDEX

0

(FIVE YEARS 0)

Published By Springer Netherlands

9789401045209, 9789401111904

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Priority-Generating Functions Ordered Sets of Jobs

Scheduling Theory. Single-Stage Systems ◽

10.1007/978-94-011-1190-4_4 ◽

1994 ◽

pp. 186-252

Author(s):

V. S. Tanaev ◽

V. S. Gordon ◽

Y. M. Shafransky

Keyword(s):

Generating Functions ◽

Ordered Sets

Download Full-text

NP-Hard Problems

Scheduling Theory. Single-Stage Systems ◽

10.1007/978-94-011-1190-4_5 ◽

1994 ◽

pp. 253-311

Author(s):

V. S. Tanaev ◽

V. S. Gordon ◽

Y. M. Shafransky

Keyword(s):

Np Hard ◽

Hard Problems ◽

Np Hard Problems

Download Full-text

Elements of Graph Theory and Computational Complexity of Algorithms

Scheduling Theory. Single-Stage Systems ◽

10.1007/978-94-011-1190-4_2 ◽

1994 ◽

pp. 40-68

Author(s):

V. S. Tanaev ◽

V. S. Gordon ◽

Y. M. Shafransky

Keyword(s):

Graph Theory ◽

Computational Complexity ◽

Complexity Of Algorithms

Download Full-text

Polynomially Solvable Problems

Scheduling Theory. Single-Stage Systems ◽

10.1007/978-94-011-1190-4_3 ◽

1994 ◽

pp. 69-185

Author(s):

V. S. Tanaev ◽

V. S. Gordon ◽

Y. M. Shafransky

Keyword(s):

Polynomially Solvable ◽

Solvable Problems

Download Full-text

Introduction

Scheduling Theory. Single-Stage Systems ◽

10.1007/978-94-011-1190-4_1 ◽

1994 ◽

pp. 1-39

Author(s):

V. S. Tanaev ◽

V. S. Gordon ◽

Y. M. Shafransky

Download Full-text