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
Solution of the NP-hard total tardiness minimization problem in scheduling theory - MaRDI portal

Solution of the NP-hard total tardiness minimization problem in scheduling theory

From MaRDI portal

Publication:5438152

Jump to:navigation, search

DOI10.1134/S0965542507060139zbMath1292.90119OpenAlexW2065975980MaRDI QIDQ5438152

Alexander A. Lazarev

Publication date: 22 January 2008

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542507060139

zbMATH Keywords

scheduling theory one machine pseudopolynomial algorithms minimization of total tardiness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A hybrid algorithm for the single-machine total tardiness problem ⋮ The single-machine total tardiness scheduling problem: review and extensions

This page was built for publication: Solution of the NP-hard total tardiness minimization problem in scheduling theory

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