A polynomial time algorithm for a chance-constrained single machine scheduling problem (Q1837104): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Stochastic spanning tree problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for the Equipollent Resource Allocation Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM / rank | |||
Normal rank | |||
Revision as of 17:15, 13 June 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
