article

Tighter bounds for LPT scheduling on uniform processors

Author:

Donald K. FriesenAuthors Info & Claims

SIAM Journal on Computing, Volume 16, Issue 3

Pages 554 - 560

https://doi.org/10.1137/0216037

Published: 01 June 1987 Publication History

Abstract

No abstract available.

Cited By

View all

Zhang SNip KWang Z(2022)Related machine scheduling with machine speeds satisfying linear constraintsJournal of Combinatorial Optimization10.1007/s10878-020-00523-144:3(1724-1740)Online publication date: 1-Oct-2022
https://dl.acm.org/doi/10.1007/s10878-020-00523-1
Ye DChen LZhang G(2021)On the price of anarchy of two-stage machine scheduling gamesJournal of Combinatorial Optimization10.1007/s10878-019-00474-242:3(616-635)Online publication date: 1-Oct-2021
https://dl.acm.org/doi/10.1007/s10878-019-00474-2
Englert MMezlaf DWestermann M(2021)Online Makespan Scheduling with Job Migration on Uniform MachinesAlgorithmica10.1007/s00453-021-00852-583:12(3537-3566)Online publication date: 19-Aug-2021
https://dl.acm.org/doi/10.1007/s00453-021-00852-5
Show More Cited By

Index Terms

Tighter bounds for LPT scheduling on uniform processors
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
      1. Heuristic function construction
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

Tighter approximation bounds for LPT scheduling in two special cases

Q||C"m"a"x denotes the problem of scheduling n jobs on m machines of different speeds such that the makespan is minimized. In the paper two special cases of Q||C"m"a"x are considered: case I, when m-1 machine speeds are equal, and there is only one ...
Bounds for LPT Schedules on Uniform Processors

We study the performance of LPT (largest processing time) schedules with respect to optimal schedules in a nonpreemptive multiprocessor environment. The processors are assumed to have different speeds and the tasks being scheduled are independent.
Tighter bounds on preemptive job shop scheduling with two machines

We consider the preemptive job shop scheduling problem with two machines, with the objective to minimize the makespan. We present an algorithm that finds a schedule of length at most P_max/2 greater than the optimal schedule length, where P_max is the ...

Comments

Information & Contributors

Information

Published In

SIAM Journal on Computing Volume 16, Issue 3

June 1987

178 pages

ISSN:0097-5397

Editor:
S. Rao Kosaraju

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 June 1987

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhang SNip KWang Z(2022)Related machine scheduling with machine speeds satisfying linear constraintsJournal of Combinatorial Optimization10.1007/s10878-020-00523-144:3(1724-1740)Online publication date: 1-Oct-2022
https://dl.acm.org/doi/10.1007/s10878-020-00523-1
Ye DChen LZhang G(2021)On the price of anarchy of two-stage machine scheduling gamesJournal of Combinatorial Optimization10.1007/s10878-019-00474-242:3(616-635)Online publication date: 1-Oct-2021
https://dl.acm.org/doi/10.1007/s10878-019-00474-2
Englert MMezlaf DWestermann M(2021)Online Makespan Scheduling with Job Migration on Uniform MachinesAlgorithmica10.1007/s00453-021-00852-583:12(3537-3566)Online publication date: 19-Aug-2021
https://dl.acm.org/doi/10.1007/s00453-021-00852-5
Aziz HChan HLi B(2019)Weighted maxmin fair share allocation of indivisible choresProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367032.3367040(46-52)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367032.3367040
Aziz HChan HLi BElkind EVeloso MAgmon NTaylor M(2019)Maxmin Share Fair Allocation of Indivisible Chores to Asymmetric AgentsProceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3306127.3331919(1787-1789)Online publication date: 8-May-2019
https://dl.acm.org/doi/10.5555/3306127.3331919
Epstein L(2018)A survey on makespan minimization in semi-online environmentsJournal of Scheduling10.1007/s10951-018-0567-z21:3(269-284)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s10951-018-0567-z
Zhang SNip KWang Z(2018)Related Machine Scheduling with Machine Speeds Satisfying Linear ConstraintsCombinatorial Optimization and Applications10.1007/978-3-030-04651-4_21(314-328)Online publication date: 15-Dec-2018
https://dl.acm.org/doi/10.1007/978-3-030-04651-4_21
Nong QFan GFang Q(2017)A coordination mechanism for a scheduling game with parallel-batching machinesJournal of Combinatorial Optimization10.1007/s10878-015-9980-933:2(567-579)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1007/s10878-015-9980-9
Ye DChen LZhang G(2017)The Price of Anarchy in Two-Stage Scheduling GamesCombinatorial Optimization and Applications10.1007/978-3-319-71147-8_15(214-225)Online publication date: 16-Dec-2017
https://dl.acm.org/doi/10.1007/978-3-319-71147-8_15
Massabò IPaletta GRuiz-Torres A(2016)A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problemJournal of Scheduling10.1007/s10951-015-0453-x19:2(207-211)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1007/s10951-015-0453-x
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Tighter approximation bounds for LPT scheduling in two special cases

Bounds for LPT Schedules on Uniform Processors

Tighter bounds on preemptive job shop scheduling with two machines

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations