availability constraints

Kellerer, Hans and Strusevich, Vitaly A. (2008) Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57 (4). pp. 769-795. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-008-9248-1)

controllable processing times

Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2007) Preemptive scheduling on uniform parallel machines with controllable job processing times. Algorithmica, 51 (4). pp. 451-473. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-007-9091-9)

FPTAS

Kellerer, Hans and Strusevich, Vitaly A. (2008) Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57 (4). pp. 769-795. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-008-9248-1)

generalized polymatroid

Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2007) Preemptive scheduling on uniform parallel machines with controllable job processing times. Algorithmica, 51 (4). pp. 451-473. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-007-9091-9)

maximum flow

Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2007) Preemptive scheduling on uniform parallel machines with controllable job processing times. Algorithmica, 51 (4). pp. 451-473. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-007-9091-9)

quadratic knapsack

Kellerer, Hans and Strusevich, Vitaly A. (2008) Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57 (4). pp. 769-795. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-008-9248-1)

scheduling agents

Kellerer, Hans and Strusevich, Vitaly A. (2008) Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57 (4). pp. 769-795. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-008-9248-1)

single machine scheduling

Kellerer, Hans and Strusevich, Vitaly A. (2008) Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57 (4). pp. 769-795. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-008-9248-1)

total weighted completion time

Kellerer, Hans and Strusevich, Vitaly A. (2008) Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57 (4). pp. 769-795. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-008-9248-1)

uniform parallel machine scheduling

Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2007) Preemptive scheduling on uniform parallel machines with controllable job processing times. Algorithmica, 51 (4). pp. 451-473. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-007-9091-9)