article

Asymptotically optimal algorithms for job shop scheduling and packet routing

Authors:

Dimitris Bertsimas,

David GamarnikAuthors Info & Claims

Journal of Algorithms, Volume 33, Issue 2

Pages 296 - 318

https://doi.org/10.1006/jagm.1999.1047

Published: 01 November 1999 Publication History

Abstract

No abstract available.

Cited By

View all

Haeupler BPatel SRoeyskoe AStein CZuzic GMohar BShinkar IO'Donnell R(2024)Polylog-Competitive Deterministic Local Routing and SchedulingProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649678(812-822)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649678
Gu MLu XGu J(2017)An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespanJournal of Combinatorial Optimization10.1007/s10878-015-9974-733:2(473-495)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1007/s10878-015-9974-7
Zhou ZBambos NGlynn P(2016)Dynamics on Linear Influence Network Games Under Stochastic Environments7th International Conference on Decision and Game Theory for Security - Volume 999610.1007/978-3-319-47413-7_7(114-126)Online publication date: 2-Nov-2016
https://dl.acm.org/doi/10.1007/978-3-319-47413-7_7
Show More Cited By

Index Terms

Asymptotically optimal algorithms for job shop scheduling and packet routing
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. Routing and network design problems
      2. 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

An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan

This paper considers the large-scale mixed job shop scheduling problem with general number of jobs on each route. The problem includes ordinary machines, batch machines (with bounded or unbounded capacity), parallel machines, and machines with ...
Parallel job scheduling algorithms
Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion

Flexible job shop scheduling problem.Ensembles of heuristics.Re-scheduling for new job insertion.Multiple objectives scheduling problem. This study investigates the flexible job shop scheduling problem (FJSP) with new job insertion. FJSP with new job ...

Comments

Information & Contributors

Information

Published In

Journal of Algorithms Volume 33, Issue 2

Nov. 1999

132 pages

ISSN:0196-6774

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 November 1999

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 09 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Haeupler BPatel SRoeyskoe AStein CZuzic GMohar BShinkar IO'Donnell R(2024)Polylog-Competitive Deterministic Local Routing and SchedulingProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649678(812-822)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649678
Gu MLu XGu J(2017)An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespanJournal of Combinatorial Optimization10.1007/s10878-015-9974-733:2(473-495)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1007/s10878-015-9974-7
Zhou ZBambos NGlynn P(2016)Dynamics on Linear Influence Network Games Under Stochastic Environments7th International Conference on Decision and Game Theory for Security - Volume 999610.1007/978-3-319-47413-7_7(114-126)Online publication date: 2-Nov-2016
https://dl.acm.org/doi/10.1007/978-3-319-47413-7_7
Ghaffari MGeorgiou CSpirakis P(2015)Near-Optimal Scheduling of Distributed AlgorithmsProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767417(3-12)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767417
Luzon YMarmor YKhmelnitsky E(2015)Optimal control of a two-server flow-shop networkJournal of Scheduling10.1007/s10951-015-0439-818:5(513-524)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1007/s10951-015-0439-8
Masin MRaviv T(2014)Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problemJournal of Scheduling10.1007/s10951-014-0376-y17:4(321-338)Online publication date: 1-Aug-2014
https://dl.acm.org/doi/10.1007/s10951-014-0376-y
Reveliotis SBountourelis T(2011)Optimal flow control in acyclic networks with uncontrollable routings and precedence constraintsDiscrete Event Dynamic Systems10.1007/s10626-011-0112-021:4(499-518)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1007/s10626-011-0112-0
Robert YVivien F(2010)Algorithmic issues in grid computingAlgorithms and theory of computation handbook10.5555/1882723.1882752(29-29)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1882723.1882752
Nazarathy YWeiss G(2010)A fluid approach to large volume job shop schedulingJournal of Scheduling10.1007/s10951-010-0174-013:5(509-529)Online publication date: 1-Oct-2010
https://dl.acm.org/doi/10.1007/s10951-010-0174-0
Bountourelis TReveliotis S(2009)Optimal Node Visitation in Acyclic Stochastic Digraphs with Multi-threaded Traversals and Internal Visitation RequirementsDiscrete Event Dynamic Systems10.1007/s10626-009-0065-819:3(347-376)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1007/s10626-009-0065-8
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan

Parallel job scheduling algorithms

Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations