research-article

Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines

Author:

Barbara SimonsAuthors Info & Claims

SIAM Journal on Computing, Volume 12, Issue 2

Pages 294 - 299

https://doi.org/10.1137/0212018

Published: 01 May 1983 Publication History

Abstract

We present a polynomial time algorithm for constructing an optimal schedule, if a feasible schedule exists, for tthe following multimachine scheduling problem. There are n unit-time jobs, with arbitrary release times and deadlines, and m identical parallel machines. A feasible schedule is one in which no job is started before it is released, each job is completed by its deadline, and no job is interrupted once it begins to run.

References

[1]

P. V. E. Boas, Preserving order in a forest in less than logarithmic time16th Annual Symposium on Foundations of Computer Science (Berkeley, Calif., 1975), IEEE Computer Society, Long Beach, Calif., 1975, 75–84

Google Scholar

[2]

J. Carlier, Problème à une machine dans le cas où les tâches ont des durées égales, Technical Report, Institut de Programmation, Université Paris VI, 1979

Google Scholar

[3]

Michael R. Garey, David S. Johnson, Computers and intractability, W. H. Freeman and Co., San Francisco, Calif., 1979x+338, A Guide to the Theory of NP-Completeness

Digital Library

Google Scholar

[4]

M. R. Garey, D. S. Johnson, Two-processor scheduling with start-times and deadlines, SIAM J. Comput., 6 (1977), 416–426

Digital Library

Google Scholar

[5]

M. R. Garey, D. S. Johnson, B. B. Simons, R. E. Tarjan, Scheduling unit-time tasks with arbitrary release times and deadlines, SIAM J. Comput., 10 (1981), 256–269

Digital Library

Google Scholar

[6]

J. R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report, 43, Management Science Research Project, Univ. of California, Los Angeles, 1955

Google Scholar

[7]

J. K. Lenstra, A. G. H. Rinnooy Kan, P. Brucker, Complexity of machine scheduling problemsStudies in integer programming (Proc. Workshop, Bonn, 1975), North-Holland, Amsterdam, 1977, 343–362. Ann. of Discrete Math., Vol. 1

Google Scholar

[8]

B. B. Simons, A fast algorithm for single processor scheduling21st Annual Symposium on Foundations of Computer Science, IEEE Computer Science, Long Beach, CA, 1978, 50–53

Google Scholar

[9]

B. B. Simons, A fast algorithm for single processor scheduling19th Annual Symposium on Foundations of Computer Science (Ann Arbor, Mich., 1978), IEEE, Long Beach, Calif., 1978, 246–252

Google Scholar

[10]

J. D. Ullman, ${\rm NP}$-complete scheduling problems, J. Comput. System Sci., 10 (1975), 384–393

Digital Library

Google Scholar

Cited By

View all

Kis TSzögi E(2024)Scheduling jobs to minimize a convex function of resource usageComputers and Operations Research10.1016/j.cor.2024.106748169:COnline publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1016/j.cor.2024.106748
Ben Mokhtar SCanon LDugois AMarchal LRivière E(2024)A scheduling framework for distributed key-value stores and its application to tail latency minimizationJournal of Scheduling10.1007/s10951-023-00803-827:2(183-202)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s10951-023-00803-8
Wang HSinnen O(2022)Scheduling Fork-Join Task Graphs with Communication Delays and Equal Processing TimesProceedings of the 51st International Conference on Parallel Processing10.1145/3545008.3545036(1-9)Online publication date: 29-Aug-2022
https://dl.acm.org/doi/10.1145/3545008.3545036

Index Terms

Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines

Index terms have been assigned to the content through auto-classification.

Recommendations

An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines

The problem of scheduling $n$ unit-time jobs with real-valued release times and deadlines is shown to be in NC. The solution is based on characterizations of a canonical schedule and best subset of jobs to be scheduled in a given time interval. The ...
Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines

The basic problem considered is that of scheduling n unit-time tasks, with arbitrary release times and deadlines, so as to minimize the maximum task completion time. Previous work has shown that this problem can be solved rather easily when all release ...
Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines

The deadline of a request is the time instant at which its execution must complete. The deadline of the request in any period of a job with deferred deadline is some time instant after the end of the period. The authors describe a semi-static priority-...

Comments

Information & Contributors

Information

Published In

SIAM Journal on Computing Volume 12, Issue 2

May 1983

196 pages

ISSN:0097-5397

DOI:10.1137/smjcat.1983.12.issue-2

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 May 1983

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kis TSzögi E(2024)Scheduling jobs to minimize a convex function of resource usageComputers and Operations Research10.1016/j.cor.2024.106748169:COnline publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1016/j.cor.2024.106748
Ben Mokhtar SCanon LDugois AMarchal LRivière E(2024)A scheduling framework for distributed key-value stores and its application to tail latency minimizationJournal of Scheduling10.1007/s10951-023-00803-827:2(183-202)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s10951-023-00803-8
Wang HSinnen O(2022)Scheduling Fork-Join Task Graphs with Communication Delays and Equal Processing TimesProceedings of the 51st International Conference on Parallel Processing10.1145/3545008.3545036(1-9)Online publication date: 29-Aug-2022
https://dl.acm.org/doi/10.1145/3545008.3545036

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines

Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines

Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations