A comment on scheduling on uniform machines under chain-type precedence constraints
From MaRDI portal
Publication:1977643
DOI10.1016/S0167-6377(99)00076-0zbMath0955.90036MaRDI QIDQ1977643
Publication date: 5 March 2001
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(99)00076-0
scheduling; approximation algorithm; makespan; precedence constraints; worst-case analysis; uniform machines
68Q25: Analysis of algorithms and problem complexity
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS, Randomized on-line scheduling on two uniform machines, Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios, Unnamed Item, Parallel machine covering with limited number of preemptions, Scheduling of uniform parallel machines with s-precedence constraints, Parametric analysis of the quality of single preemption schedules on three uniform parallel machines, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms, Optimal and online preemptive scheduling on uniformly related machines, The benefit of preemption for single machine scheduling so as to minimize total weighted completion time, Algorithms with limited number of preemptions for scheduling on parallel machines, Preemptive and non-preemptive scheduling on two unrelated parallel machines, Schedules with a single preemption on uniform parallel machines, The benefit of preemption with respect to the \(\ell_p\) norm, Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines
Cites Work
