Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing-Reference-Cited by-同舟云学术

Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing

Author:

Bertsimas Dimitris,Gamarnik David

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference17 articles.

1. Optimization of multiclass queueing networks: a linear control approach;Avram,1995

3. Improved bounds for acyclic job shop scheduling;Feige,1998

4. Better approximation guarantees for job-shop scheduling;Goldberg,1997

5. Approximation algorithms for scheduling;Hall,1997

Cited by 49 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polylog-Competitive Deterministic Local Routing and Scheduling;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. A Fast and Efficient Fluid Relaxation Algorithm for Large-Scale Re-entrant Flexible Job Shop Scheduling;Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems;2021

5. Network Coding Gaps for Completion Times of Multiple Unicasts;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11