Single machine scheduling to minimize the number of late jobs under uncertainty. (Q1413868): 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/s0165-0114(02)00505-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986661310 / rank | |||
Normal rank | |||
Latest revision as of 11:22, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single machine scheduling to minimize the number of late jobs under uncertainty. |
scientific article |
Statements
Single machine scheduling to minimize the number of late jobs under uncertainty. (English)
0 references
17 November 2003
0 references
Combinatorial problems
0 references
Scheduling
0 references
Single machine
0 references
Number of late jobs
0 references
