The following pages link to Scheduling File Transfers (Q3741046):
Displaying 38 items.
- An integer linear formulation for the file transfer scheduling problem (Q287646) (← links)
- Edge-chromatic sum of trees and bounded cyclicity graphs (Q294800) (← links)
- On a local protocol for concurrent file transfers (Q487273) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers (Q862738) (← links)
- \(\mathrm{M}_2\)-edge colorings of cacti and graph joins (Q907831) (← links)
- Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
- Data transfers in networks (Q1097687) (← links)
- Bin packing with divisible item sizes (Q1100914) (← links)
- Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299) (← links)
- Distributed processing of divisible jobs with communication startup costs (Q1363737) (← links)
- Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors (Q1372768) (← links)
- On the complexity of coordinated display of multimedia objects (Q1575545) (← links)
- Minimum multiplicity edge coloring via orientation (Q1671364) (← links)
- On \(f\)-colorings of nearly bipartite graphs (Q1707984) (← links)
- Minimum-delay schedules in layered networks (Q1812948) (← links)
- An approximation algorithm for scheduling on three dedicated machines (Q1897367) (← links)
- A linear time algorithm for edge coloring of binomial trees (Q1916114) (← links)
- Scheduling multiprocessor tasks for mean flow time criterion (Q1977621) (← links)
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion (Q2149611) (← links)
- On the fg-coloring of graphs (Q2277478) (← links)
- On a resource-constrained scheduling problem with application to distributed systems reconfiguration (Q2371345) (← links)
- Algorithms for data migration (Q2379927) (← links)
- The method of coloring in graphs and its application (Q2429917) (← links)
- Multi-coloring and job-scheduling with assignment and incompatibility costs (Q2449346) (← links)
- Some graphs of class 1 for \(f\)-colorings (Q2472816) (← links)
- Minimum sum multicoloring on the edges of trees (Q2503344) (← links)
- Scheduling: agreement graph vs resource constraints (Q2629638) (← links)
- A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200) (← links)
- Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles (Q3066941) (← links)
- On the fractional<i>f</i>-chromatic index of a graph (Q3066980) (← links)
- Scheduling multiprocessor tasks on two parallel processors (Q3148375) (← links)
- A note on M2-edge colorings of graphs (Q3458960) (← links)
- Min Sum Edge Coloring in Multigraphs Via Configuration LP (Q3503859) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS (Q5249291) (← links)
- The complexity of path coloring and call scheduling (Q5941061) (← links)
