TWO CONP-COMPLETE SCHEDULE ANALYSIS PROBLEMS
From MaRDI portal
Publication:5249280
DOI10.1142/S0129054101000667zbMath1319.68044OpenAlexW2056155753WikidataQ128392224 ScholiaQ128392224MaRDI QIDQ5249280
Publication date: 30 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054101000667
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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
This page was built for publication: TWO CONP-COMPLETE SCHEDULE ANALYSIS PROBLEMS