Scheduling with semaphore constraints

Authors:
Errol L. Lloyd
Affiliations:
Department of Computer Science, University of Pittsburgh, 322 Alumni Hall, Pittsburgh, PA 15260, USA
Venue:
Operations Research Letters
Year:
1987

Citing 3
Cited 0

Deterministic Processor Scheduling

ACM Computing Surveys (CSUR)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider task systems with semaphore constraints, a generalization of the standard deterministic scheduling model that allows a broad class of task dependencies. We show that minimum length scheduling of task systems with semaphore constraints is NP-complete on two processors even when the tasks have identical execution times. In addition, we provide a linear time algorithm for determining the consistency of a task system with semaphore constraints.