Task Scheduling in Networks

DOI10.1137/S0895480194279057zbMath0885.68020MaRDI QIDQ4377449

Joel M. Wein, Cynthia A. Phillips, Clifford Stein

Publication date: 9 February 1998

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

zbMATH Keywords

schedulingapproximation algorithmnetworksNP-completeness

Mathematics Subject Classification ID

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

Related Items

GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times, Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms, A new approximation algorithm for unrelated parallel machine scheduling with release dates, Minimizing average completion time in the presence of release dates, Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines, A PTAS for the average weighted completion time problem on unrelated machines., Off-line admission control for general scheduling problems