On the complexity of scheduling unit-time jobs with OR-precedence constraints

Authors:
Berit Johannes
Affiliations:
Institut für Mathematik, Sekr. MA 6-1, Technische Universität Berlin, Strasse des 17. Juni 136, 10623 Berlin, Germany
Venue:
Operations Research Letters
Year:
2005

Citing 5
Cited 1

Scheduling Tasks with AND/OR Precedence Constraints

SIAM Journal on Computing
Scheduling Tasks with Nonuniform Deadlines on Two Processors

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling with AND/OR Precedence Constraints

SIAM Journal on Computing
NP-complete scheduling problems

Journal of Computer and System Sciences

The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present various complexity results for scheduling unit-time jobs subject to OR-precedence constraints. We prove that minimizing the total weighted completion time is strongly NP-hard, even on a single machine. In contrast, we give a polynomial-time algorithm for minimizing the makespan and the total completion time on identical parallel machines.