\(N\)-extendible posets, and how to minimize total weighted completion time (Q1962041)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: N-extendible posets, and how to minimize total weighted completion time |
scientific article; zbMATH DE number 1395009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(N\)-extendible posets, and how to minimize total weighted completion time |
scientific article; zbMATH DE number 1395009 |
Statements
\(N\)-extendible posets, and how to minimize total weighted completion time (English)
0 references
14 November 2000
0 references
extendible comparability graphs
0 references
extendible posets
0 references
sparse posets
0 references
single machine scheduling
0 references
0 references
0 references
0.89394915
0 references
0.86552423
0 references
0.8453919
0 references
0.84360576
0 references
0.8419455
0 references
0.8419455
0 references
0.8410924
0 references
