scientific article

From MaRDI portal

Revision as of 15:42, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3824093

Jump to:navigation, search

zbMath0671.90036MaRDI QIDQ3824093

Yuri N. Sotskov

Publication date: 1989

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

zbMATH Keywords

NP-hard fixed machine orders optimal makespan scheduling

Mathematics Subject Classification ID

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

Related Items (3)

NP-hardness of shop-scheduling problems with three jobs ⋮ The complexity of shop-scheduling problems with two or three jobs ⋮ Complexity of shop-scheduling problems with fixed number of jobs: a survey

This page was built for publication:

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