Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem (Q3659513)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3811295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem |
scientific article; zbMATH DE number 3811295 |
Statements
Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem (English)
0 references
1983
0 references
NP-completeness
0 references
chance-constrained scheduling
0 references
random processing times
0 references
minimization of the number of tardy jobs
0 references
Balut's algorithm
0 references
n-job one- machine scheduling
0 references
