Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 1235242 - MaRDI portal

scientific article; zbMATH DE number 1235242

From MaRDI portal

Publication:4223483

Jump to:navigation, search

zbMath0909.90183MaRDI QIDQ4223483

Adrianus Petrus Antonius Vestjens

Publication date: 4 January 1999

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

zbMATH Keywords

single-machine scheduling randomization makespan lower bounds parallel machine scheduling total completion time maximum lateness polynomial-time heuristic complexity of job insertion on-line setting

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times ⋮ The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates ⋮ Single-machine online scheduling of jobs with non-delayed processing constraint ⋮ A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4223483&oldid=18093642"