Reducibility among single machine weighted completion time scheduling problems (Q922287): 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.1007/bf02248586 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983340643 / rank | |||
Normal rank | |||
Latest revision as of 10:15, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducibility among single machine weighted completion time scheduling problems |
scientific article |
Statements
Reducibility among single machine weighted completion time scheduling problems (English)
0 references
1990
0 references
sum of weighted completion time problems
0 references
release date
0 references
deadline
0 references
continuous machine processing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
