Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines (Q5289354): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1057/jors.1993.4 / 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.1057/jors.1993.4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973805410 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1057/JORS.1993.4 / rank | |||
Normal rank | |||
Latest revision as of 16:37, 30 December 2024
scientific article; zbMATH DE number 279398
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines |
scientific article; zbMATH DE number 279398 |
Statements
Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines (English)
0 references
23 August 1993
0 references
heuristics
0 references
single operation jobs
0 references
common due date
0 references
non-identical machines (in parallel)
0 references
absolute lateness
0 references
transportation problem
0 references
polynomial time algorithm
0 references
identical machines
0 references
makespan
0 references
