article

Free access

Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan

Authors:

J. Bruno,

P. Downey, and

G. N. FredericksonAuthors Info & Claims

Journal of the ACM (JACM), Volume 28, Issue 1

Pages 100 - 113

https://doi.org/10.1145/322234.322242

Published: 01 January 1981 Publication History

PDF eReader

References

[1]

COFFMAN, E.G. JR., ED. Computer and Job-Shop Scheduling Theory. John Wiley, New York, 1976.

Google Scholar

[2]

CONWAY, R.W., MAXWELL, W.L., Ah'D MILLER, L.W. Theory of Scheduling. Addison-Wesley, Reading, Mass., 1967.

Google Scholar

[3]

GRAHAM, R.L. Bounds on muhiprocessing timing anomalies. SlAM J. Appl. Math. 17, 2 (March 1969), 416--429.

Google Scholar

[4]

KARP, R.M. Reducibility among combinatorial problems. In The Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, Eds., Plenum Publishing, New York, 1972.

Google Scholar

[5]

MCNAUGHTON, R. Scheduling with deadlines and loss functions. Manage. ScL 6 (1959), 1-12.

Google Scholar

[6]

ROTHKOPF, M.H. Scheduling with random service times. Manage. Sci. 12 (1966), 707-713.

Google Scholar

[7]

SMITH, W.E. Various optimizers for single-stage production. Naval Res. Log. Q. 3 (1956), 59-66.

Google Scholar

[8]

WEBER, R.R. Optimal organization of multi-server systems. Ph.D. Dissertation, Queen's College, Cambridge, April 1979.

Google Scholar

Cited By

View all

Qu ZDawande MJanakiraman G(2024)Technical Note—Cloud Cost OptimizationOperations Research10.1287/opre.2022.036272:1(132-150)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1287/opre.2022.0362
Piechowiak KDrozdowski MSanlaville É(2022)Framework of algorithm portfolios for strip packing problemComputers & Industrial Engineering10.1016/j.cie.2022.108538172(108538)Online publication date: Oct-2022
https://doi.org/10.1016/j.cie.2022.108538
Baier CHermanns HKatoen J(2022)The 10,000 Facets of MDP Model CheckingComputing and Software Science10.1007/978-3-319-91908-9_21(420-451)Online publication date: 11-Mar-2022
https://dl.acm.org/doi/10.1007/978-3-319-91908-9_21
Show More Cited By

Index Terms

Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
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

Complexity of minimizing makespan and mean flow time
Read More
Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times

In this study, we consider an n-job, m-machine flow shop scheduling problem with decreasing time-dependent job processing times. By the decreasing time-dependent job processing times, we mean that the processing time is a decreasing function of its ...
Read More
Single machine batch scheduling problem with family setup times and release dates to minimize makespan

In this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an $$O(n (\frac{n}{m}+1)^m)$$ time dynamic programming algorithm and an $$O(mk^{k}P^{2k-1})$$ time dynamic ...
Read More

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 28, Issue 1

Jan. 1981

190 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322234

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1981

Published in JACM Volume 28, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

100
Total Citations
View Citations
775
Total Downloads

Downloads (Last 12 months)48
Downloads (Last 6 weeks)9

Other Metrics

View Author Metrics

Citations

Cited By

View all

Qu ZDawande MJanakiraman G(2024)Technical Note—Cloud Cost OptimizationOperations Research10.1287/opre.2022.036272:1(132-150)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1287/opre.2022.0362
Piechowiak KDrozdowski MSanlaville É(2022)Framework of algorithm portfolios for strip packing problemComputers & Industrial Engineering10.1016/j.cie.2022.108538172(108538)Online publication date: Oct-2022
https://doi.org/10.1016/j.cie.2022.108538
Baier CHermanns HKatoen J(2022)The 10,000 Facets of MDP Model CheckingComputing and Software Science10.1007/978-3-319-91908-9_21(420-451)Online publication date: 11-Mar-2022
https://dl.acm.org/doi/10.1007/978-3-319-91908-9_21
Agarwal CGuha SKřetínský JMuruganandham P(2022)PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDPComputer Aided Verification10.1007/978-3-031-13188-2_1(3-25)Online publication date: 7-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-13188-2_1
Quatmann TJunges SKatoen J(2021)Markov automata with multiple objectivesFormal Methods in System Design10.1007/s10703-021-00364-660:1(33-86)Online publication date: 29-Mar-2021
https://dl.acm.org/doi/10.1007/s10703-021-00364-6
Gupta VMoseley BUetz MXie Q(2020)Greed Works—Online Algorithms for Unrelated Machine Stochastic SchedulingMathematics of Operations Research10.1287/moor.2019.099945:2(497-516)Online publication date: May-2020
https://doi.org/10.1287/moor.2019.0999
Gainaru AGoglin BHonoré VPallez G(2020)Profiles of Upcoming HPC Applications and Their Impact on Reservation StrategiesIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2020.303972832:5(1178-1190)Online publication date: 23-Dec-2020
https://dl.acm.org/doi/10.1109/TPDS.2020.3039728
Gainaru AGoglin BHonore VPallez Aupy GRaghavan PRobert YSun H(2020)Reservation and Checkpointing Strategies for Stochastic Jobs2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS47924.2020.00092(853-863)Online publication date: May-2020
https://doi.org/10.1109/IPDPS47924.2020.00092
Delgrange FKatoen JQuatmann TRandour M(2020)Simple Strategies in Multi-Objective MDPsTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-030-45190-5_19(346-364)Online publication date: 25-Apr-2020
https://dl.acm.org/doi/10.1007/978-3-030-45190-5_19
Dongarra JTourancheau BGainaru ASun HAupy GHuo YLandman BRaghavan P(2019)On-the-fly scheduling versus reservation-based scheduling for unpredictable workflowsInternational Journal of High Performance Computing Applications10.1177/109434201984168133:6(1140-1158)Online publication date: 1-Nov-2019
https://dl.acm.org/doi/10.1177/1094342019841681
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

Complexity of minimizing makespan and mean flow time

Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times

Single machine batch scheduling problem with family setup times and release dates to minimize makespan

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