scientific article; zbMATH DE number 2044495
From MaRDI portal
zbMath1042.90020MaRDI QIDQ4448359
Juraj Hromkovič, K. Steinhöfel, Peter Widmayer
Publication date: 18 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2202/22020090.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Advice Complexity of Fine-Grained Job Shop Scheduling, Firefly-Inspired Algorithm for Job Shop Scheduling, On the power of randomization for job shop scheduling withk-units length tasks
