Minimizing the sum of absolute lateness in single-machine and multimachine scheduling (Q3335507): 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.3800310214 / 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.3800310214 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134958868 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NAV.3800310214 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:16, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the sum of absolute lateness in single-machine and multimachine scheduling |
scientific article |
Statements
Minimizing the sum of absolute lateness in single-machine and multimachine scheduling (English)
0 references
1984
0 references
sum of absolute lateness
0 references
common due date
0 references
identical parallel machines
0 references
heuristic method
0 references
computational results
0 references
