scientific article; zbMATH DE number 5179132

zbMath1186.90051MaRDI QIDQ5755525

Juraj Hromkovič, Tobias Mömke, K. Steinhöfel, Peter Widmayer

Publication date: 13 August 2007

Full work available at URL: http://journals.hil.unb.ca/index.php/AOR/article/view/2729

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Job shop scheduling with unit length tasks ⋮ A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey ⋮ Firefly-Inspired Algorithm for Job Shop Scheduling ⋮ Advice Complexity and Barely Random Algorithms ⋮ Complexity, bounds and dynamic programming algorithms for single track train scheduling ⋮ Online algorithms with advice: the tape model ⋮ Advice Complexity and Barely Random Algorithms ⋮ On the power of randomization for job shop scheduling withk-units length tasks

This page was built for publication: