A polynomial time algorithm for a chance-constrained single machine scheduling problem (Q1837104): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(83)90038-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2032618916 / rank | |||
Normal rank | |||
Latest revision as of 10:53, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm for a chance-constrained single machine scheduling problem |
scientific article |
Statements
A polynomial time algorithm for a chance-constrained single machine scheduling problem (English)
0 references
1983
0 references
chance-constrained sequencing problem
0 references
single machine
0 references
polynomial time algorithm
0 references
NP-hardness
0 references
0 references
0 references
