Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem (Q3659513): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/mnsc.29.3.384 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2124713686 / rank | |||
Normal rank | |||
Latest revision as of 18:09, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem |
scientific article |
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
