Scheduling problems over network of machines

DOI10.4230/LIPICS.APPROX-RANDOM.2017.5MaRDI QIDQ5002605zbMATH OpenOpenAlexFDO

Authors Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad Salavatipour, Yifeng Zhang

Publication date 28 July 2021

Full work available at URL https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.5

zbMATH Keywords

approximation algorithmsjob-shop schedulingminimum latencymin-sum edge coloring

Mathematics Subject Classification ID

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)

Recommendations

• Scheduling problems over a network of machines
• Task Scheduling in Networks
• Routing open shop and flow shop scheduling problems
• Task scheduling in networks
• Scheduling in the presence of processor networks : complexity and approximation

Cites work

• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• scientific article; zbMATH DE number 1775452 (Why is no real title available?)
• scientific article; zbMATH DE number 2086940 (Why is no real title available?)
• Approximation algorithms for shop scheduling problems with minsum objective
• Approximation algorithms for shop scheduling problems with minsum objective: A correction
• Combinatorial algorithms for data migration to minimize average completion time
• Constraint satisfaction, packet routing, and the lovasz local lemma
• Coordination mechanisms for selfish routing over time on a tree
• Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
• Hardness of approximating flow and job shop scheduling problems
• Improved Approximation Algorithms for Shop Scheduling Problems
• Improved bounds for scheduling conflicting jobs with minsum criteria
• Job Shop Scheduling with Unit Processing Times
• Minimizing total weighted completion time in a proportionate flow shop
• Packet Routing on the Grid
• Packet Routing: Complexity and Algorithms
• Packet forwarding algorithms in a line network
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Scheduling problems in transportation networks of line topology
• Sum edge coloring of multigraphs via configuration LP

Cited in

(5)

• Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
• Scheduling in the presence of processor networks : complexity and approximation
• Network scheduling problem with cross-docking and loading constraints
• Scheduling problems over a network of machines
• Task scheduling in networks

This page was built for publication: Scheduling problems over network of machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5002605)