Task Scheduling in Networks
From MaRDI portal
Publication:4377449
DOI10.1137/S0895480194279057zbMATH Open0885.68020MaRDI QIDQ4377449FDOQ4377449
Authors: Cynthia Phillips, Clifford Stein, Joel Wein
Publication date: 9 February 1998
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Recommendations
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cited In (24)
- Scheduling independent jobs for torus connected networks with/without link contention.
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
- Minimizing average completion time in the presence of release dates
- Title not available (Why is that?)
- On the Complexity of Scheduling to Optimize Average Response Time
- Off-line admission control for general scheduling problems
- Title not available (Why is that?)
- Scheduling problems over network of machines
- Network construction problems with due dates
- Network service scheduling and routing
- On approximating a scheduling problem
- Task swapping networks in distributed systems
- Scheduling problems over a network of machines
- The \(k\)-track assignment problem
- Scheduling problems in transportation networks of line topology
- Network scheduling techniques for construction project management
- Task scheduling in networks
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Scheduling in switching networks with set-up delays
- A PTAS for the average weighted completion time problem on unrelated machines.
- Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget
- Non-preemptive scheduling to maximize the minimum global inter-completion time
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
This page was built for publication: Task Scheduling in Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377449)