\(N\)-extendible posets, and how to minimize total weighted completion time (Q1962041): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:36, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(N\)-extendible posets, and how to minimize total weighted completion time |
scientific article |
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
