article

Free access

Scheduling Independent Tasks with Due Times on a Uniform Processor System

Authors:

Sartaj Sahni,

Yookun ChoAuthors Info & Claims

Journal of the ACM (JACM), Volume 27, Issue 3

Pages 550 - 563

https://doi.org/10.1145/322203.322214

Published: 01 July 1980 Publication History

PDF eReader

References

[1]

BRUNO, J., AND GONZALEZ, T. Scheduling independent tasks with release dates and due dates on parallel machines Tech. Rep. No. 213, Pennsylvania State U., University Park, Pa., Dec. 1976.

Google Scholar

[2]

GONZALEZ, T., AND SAHNI, S. Preemptive scheduling of uniform processor systems./. ACM 25, I (Jan. 1978), 92-101.

Crossref

Google Scholar

[3]

HORN, W. Some simple scheduling algorithms. Nay. Res. Log. Qtr. 21 (1974), 177-185.

Google Scholar

[4]

LIu, J., AND LIU, C. Bounds on scheduling algorithms for heterogeneous computing systems. In Information Processing 1974, North Holland, Amsterdam, pp. 349-353.

Google Scholar

[5]

SAHNI, S. Preemptive scheduling with due dates. Oper. Research 27, 5 (Sept.-Oct. 1979), 925-934.

Google Scholar

Cited By

View all

Hung HLin BPosner MWei J(2019)Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobsJournal of Scheduling10.1007/s10951-018-0584-y22:4(413-431)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.1007/s10951-018-0584-y
Shioura AShakhlevich NStrusevich V(2018)Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approachesEuropean Journal of Operational Research10.1016/j.ejor.2017.08.034266:3(795-818)Online publication date: May-2018
https://doi.org/10.1016/j.ejor.2017.08.034
Shioura AShakhlevich NStrusevich V(2018)Scheduling problems with controllable processing times and a common deadline to minimize maximum compression costJournal of Global Optimization10.1007/s10898-018-0686-2Online publication date: 6-Jul-2018
https://doi.org/10.1007/s10898-018-0686-2
Show More Cited By

Index Terms

Scheduling Independent Tasks with Due Times on a Uniform Processor System
1. Computing methodologies
  1. Artificial intelligence
    1. Planning and scheduling
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

Scheduling independent multiprocessor tasks on a uniform k-processor system
Nearly on Line Scheduling of a Uniform Processor System with Release Times

An $O(m^2 n + mn\log n)$ nearly on line algorithm to preemptively schedule n independent tasks on m uniform processors is presented. It is assumed that there is a release time associated with each task. No task may be started before its release time. All ...
A new scheduling algorithm for non-preemptive independent tasks on a multi-processor platform
Special Issue on the First Workshop on Declarative Programming for Real-Time and Cyber-Physical Systems (DPRTCPS 2015)

The abort-and-restart scheme from the Priority-based Functional Reactive Programming (PFRP) paradigm eliminates the priority inversion problem. This paper is similar by solving the priority inversion problem using the task order restrictions sets of ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 27, Issue 3

July 1980

195 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322203

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1980

Published in JACM Volume 27, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

46
Total Citations
View Citations
547
Total Downloads

Downloads (Last 12 months)38
Downloads (Last 6 weeks)3

Reflects downloads up to 18 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hung HLin BPosner MWei J(2019)Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobsJournal of Scheduling10.1007/s10951-018-0584-y22:4(413-431)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.1007/s10951-018-0584-y
Shioura AShakhlevich NStrusevich V(2018)Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approachesEuropean Journal of Operational Research10.1016/j.ejor.2017.08.034266:3(795-818)Online publication date: May-2018
https://doi.org/10.1016/j.ejor.2017.08.034
Shioura AShakhlevich NStrusevich V(2018)Scheduling problems with controllable processing times and a common deadline to minimize maximum compression costJournal of Global Optimization10.1007/s10898-018-0686-2Online publication date: 6-Jul-2018
https://doi.org/10.1007/s10898-018-0686-2
Shioura AShakhlevich NStrusevich V(2016)Handling Scheduling Problems with Controllable Parameters by Methods of Submodular OptimizationDiscrete Optimization and Operations Research10.1007/978-3-319-44914-2_7(74-90)Online publication date: 10-Sep-2016
https://doi.org/10.1007/978-3-319-44914-2_7
Pinedo MPinedo M(2016)Parallel Machine Models (Deterministic)Scheduling10.1007/978-3-319-26580-3_5(113-150)Online publication date: 11-Feb-2016
https://doi.org/10.1007/978-3-319-26580-3_5
Shioura AShakhlevich NStrusevich V(2015)Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing timesMathematical Programming: Series A and B10.1007/s10107-014-0814-9153:2(495-534)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1007/s10107-014-0814-9
Qi YWan L(2013)A Competitive Two-Agent Scheduling Problem on Parallel Machines with Release Dates and PreemptionMathematical Problems in Engineering10.1155/2013/1240832013(1-5)Online publication date: 2013
https://doi.org/10.1155/2013/124083
Shioura AShakhlevich NStrusevich V(2013)A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel MachinesSIAM Journal on Discrete Mathematics10.1137/11084383627:1(186-204)Online publication date: Jan-2013
https://doi.org/10.1137/110843836
Jolai FAmalnick MAlinaghian MShakhsi-Niaei MOmrani H(2011)A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machinesJournal of Intelligent Manufacturing10.1007/s10845-009-0285-722:2(247-261)Online publication date: 1-Apr-2011
https://dl.acm.org/doi/10.1007/s10845-009-0285-7
Senthilkumar PNarayanan S(2010)Literature Review of Single Machine Scheduling Problem with Uniform Parallel MachinesIntelligent Information Management10.4236/iim.2010.2805602:08(457-474)Online publication date: 2010
https://doi.org/10.4236/iim.2010.28056
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

References

Cited By

Index Terms

Recommendations

Scheduling independent multiprocessor tasks on a uniform k-processor system

Nearly on Line Scheduling of a Uniform Processor System with Release Times

A new scheduling algorithm for non-preemptive independent tasks on a multi-processor platform

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations