On the complexity of scheduling tasks with discrete starting times

Authors:
J Mark Keil
Affiliations:
Dept. of Computational Science, University of Saskatchewan, Saskatoon, Canada S7N 0W0
Venue:
Operations Research Letters
Year:
1992

Citing 2
Cited 2

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

On the tradeoff between privacy and efficiency: A bidding mechanism for scheduling non-commercial services

Computers in Industry
Interval selection with machine-dependent intervals

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of scheduling tasks with a discrete set of possible starting times, on a single processor. We show the problem NP-complete even when all tasks require the same execution time and each task has at most three possible starting times. We also present a polynomially solvable case.