Minimizing the number of late jobs in a stochastic setting using a chance constraint (Q835575): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3951448 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank | |||
Normal rank | |||
Latest revision as of 22:52, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the number of late jobs in a stochastic setting using a chance constraint |
scientific article |
Statements
Minimizing the number of late jobs in a stochastic setting using a chance constraint (English)
0 references
28 August 2009
0 references
scheduling
0 references
sequencing
0 references
single machine
0 references
number of late jobs
0 references
stochastic processing times
0 references
Minimum success probability
0 references
Chance constraint
0 references
Dynamic programming
0 references
NP-hardness
0 references
0 references
0 references
