scientific article
zbMath0970.90035MaRDI QIDQ2711195
Publication date: 6 May 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
schedulingNP-completenessapproximation algorithmspreemptive schedulingoptimal algorithmssingle-machine problempipelined operator tree problem
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
This page was built for publication: