Complexity results for scheduling chains on a single machine (Q1142687)
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: Complexity results for scheduling chains on a single machine |
scientific article; zbMATH DE number 3687072
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity results for scheduling chains on a single machine |
scientific article; zbMATH DE number 3687072 |
Statements
Complexity results for scheduling chains on a single machine (English)
0 references
1980
0 references
scheduling chains
0 references
single machine
0 references
deterministic sequencing problems
0 references
unit-time jobs
0 references
chain-like precedence constraints
0 references
total weighted tardiness
0 references
total weighted completion time criterion
0 references
computational complexity
0 references
NP-hard problems
0 references
minimization of late jobs
0 references
0 references
