A note on “scheduling unit-time tasks with integer release times and deadlines”

doi:10.1016/0020-0190(93)90241-Z

Information Processing Letters

Volume 47, Issue 3, 14 September 1993, Pages 165-166

https://doi.org/10.1016/0020-0190(93)90241-Z Get rights and content

Abstract

Frederickson considered the problem of scheduling n unit-time tasks on m processors in which the tasks have integer release times and deadlines. Using appropriate data structures, he presented an O(n) time algorithm for the problem. However, it can be shown that this algorithm could conceivably construct an infeasible schedule. We show how this problem can be resolved while the linearity of the algorithm is preserved.

References (2)

G. Frederickson
Scheduling unit-time tasks with integer release times and deadlines
Inform. Process. Lett.
(1983)
M. Garey et al.
Scheduling unit-time tasks with arbitrary release times and deadlines
SIAM J. Comput.
(1981)

Cited by (4)

A linear time algorithm for maximum matchings in convex, bipartite graphs
1996, Computers and Mathematics with Applications
The problem of determining the maximum matching in a convex bipartite graph, G = (V₁, V₂, E), is considered. It is shown that by using the appropriate data structures, the maximum matching problem can be efficiently transformed into an off-line minimum problem. Since the off-line minimum problem has been shown to be linear, the maximum matching in a convex bipartite graph can be determined in O(|V₁|) time.
Interval-Constrained Bipartite Matching over Time
2024, arXiv
Parallel machine scheduling with unit time distinct due windows
2019, 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2018 - Proceedings of the Workshop
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
2016, Annals of Operations Research

^☆: This research was supported in part by the Natural Sciences and Engineering Research Council under grant A1798.

View full text

A note on “scheduling unit-time tasks with integer release times and deadlines”☆

Abstract

Inform. Process. Lett.

Scheduling unit-time tasks with arbitrary release times and deadlines

SIAM J. Comput.