scientific article; zbMATH DE number 6472638
From MaRDI portal
Publication:5501840
zbMath1321.68496MaRDI QIDQ5501840
No author found.
Publication date: 14 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine ⋮ Metaheuristics for order scheduling problem with unequal ready times ⋮ Reoptimization in machine scheduling ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates ⋮ Off-line admission control for general scheduling problems ⋮ The power of \(\alpha\)-points in preemptive single machine scheduling. ⋮ Approximation algorithms for shop scheduling problems with minsum objective ⋮ Randomized algorithms for on-line scheduling problems: How low can't you go?
