Insights into two solution procedures for the single machine tardiness problem (Q4656685): 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.1057/palgrave.jors.2601384 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/palgrave.jors.2601384 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016197135 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1057/PALGRAVE.JORS.2601384 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:00, 30 December 2024
scientific article; zbMATH DE number 2144426
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Insights into two solution procedures for the single machine tardiness problem |
scientific article; zbMATH DE number 2144426 |
Statements
Insights into two solution procedures for the single machine tardiness problem (English)
0 references
14 March 2005
0 references
single machine scheduling
0 references
minimizing tardiness
0 references
optimal and heuristic decomposition
0 references
modified due date rule
0 references
