A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness (Q3737193): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/nav.3800330319 / rank | |||
| 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.1002/nav.3800330319 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004885905 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NAV.3800330319 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:55, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness |
scientific article |
Statements
A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness (English)
0 references
1986
0 references
Smith-heuristic
0 references
single-machine scheduling
0 references
total weighted completion time
0 references
worst-case analysis
0 references
