Scheduling Problems over Network of Machines
From MaRDI portal
Publication:5002605
DOI10.4230/LIPIcs.APPROX-RANDOM.2017.5zbMath1467.90006OpenAlexW2747422829MaRDI QIDQ5002605
Zachary Friggstad, Mirmahdi Rahgoshay, Christopher S. Martin, Kamyar Khodamoradi, Mohammad R. Salavatipour, Mohsen Rezapour, Arnoosh Golestanian, Yifeng Zhang
Publication date: 28 July 2021
Full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.5
Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for shop scheduling problems with minsum objective: A correction
- Combinatorial algorithms for data migration to minimize average completion time
- Minimizing total weighted completion time in a proportionate flow shop
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Approximation algorithms for shop scheduling problems with minsum objective
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
- Scheduling problems in transportation networks of line topology
- Sum edge coloring of multigraphs via configuration LP
- Packet Routing on the Grid
- Packet Routing: Complexity and Algorithms
- Improved Approximation Algorithms for Shop Scheduling Problems
- Improved bounds for scheduling conflicting jobs with minsum criteria
- Coordination Mechanisms for Selfish Routing over Time on a Tree
- Job Shop Scheduling with Unit Processing Times
- Hardness of Approximating Flow and Job Shop Scheduling Problems
- Packet Forwarding Algorithms in a Line Network
- Constraint satisfaction, packet routing, and the lovasz local lemma
This page was built for publication: Scheduling Problems over Network of Machines
