Scheduling on unrelated machines under tree-like precedence constraints

Conference proceeding

Peer reviewed

V. S ANIL KUMAR, Madhav V Marathe, Srinivasan Parthasarathy, Aravind Srinivasan and Sunil Kumar

Lecture notes in computer science, Vol.3624, pp.146-157

Approximation, randomization and combinatorial optimization : algorithms and techniques (Berkeley CA, 22-24 August 2005)

2005

Abstract

Algorithmics. Computability. Computer arithmetics

Applied sciences

Computer science; control theory; systems

Exact sciences and technology

Flows in networks. Combinatorial problems

Operational research and scientific management

Operational research. Management science

Scheduling, sequencing

Theoretical computing

1 Record Views

Title: Scheduling on unrelated machines under tree-like precedence constraints
Creators - without role: V. S ANIL KUMAR - Los Alamos National Laboratory
Madhav V Marathe - Virginia Tech
Srinivasan Parthasarathy - University of Maryland, College Park
Aravind Srinivasan - University of Maryland, College Park
Sunil Kumar - King Khalid University
Publication Details: Lecture notes in computer science, Vol.3624, pp.146-157
Conference: Approximation, randomization and combinatorial optimization : algorithms and techniques (Berkeley CA, 22-24 August 2005)
Publisher: Springer
Identifiers: 9922550608331
Academic Unit: King Khalid University
Language: English
Resource Type: Conference proceeding