Task Scheduling in Networks

DOI10.1137/S0895480194279057MaRDI QIDQ4377449zbMATH OpenFDO

Authors Cynthia Phillips, Clifford Stein, Joel Wein

Publication date 9 February 1998

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480194279057

zbMATH Keywords

approximation algorithmnetworksNP-completenessscheduling

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Task scheduling in networks
• Scheduling problems over a network of machines
• Scheduling problems over network of machines
• Scheduling in the presence of processor networks : complexity and approximation
• Scheduling jobs that arrive over time

Cited in

(24)

• Minimizing average completion time in the presence of release dates
• The k-track assignment problem
• Network scheduling techniques for construction project management
• A PTAS for the average weighted completion time problem on unrelated machines.
• Off-line admission control for general scheduling problems
• Scheduling independent jobs for torus connected networks with/without link contention.
• Scheduling in switching networks with set-up delays
• 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
• Scheduling problems over a network of machines
• A new approximation algorithm for unrelated parallel machine scheduling with release dates
• Scheduling problems in transportation networks of line topology
• Task swapping networks in distributed systems
• Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget
• Network construction problems with due dates
• On the Complexity of Scheduling to Optimize Average Response Time
• scientific article; zbMATH DE number 1560337 (Why is no real title available?)
• Network service scheduling and routing
• scientific article; zbMATH DE number 1929963 (Why is no real title available?)
• Scheduling problems over network of machines
• Task scheduling in networks
• On approximating a scheduling problem
• A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms

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)