A hybrid algorithm for the one machine sequencing problem to minimize total tardiness (Q5638123): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.3800180304 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2149931128 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3292915 / rank | |||
Normal rank | |||
Latest revision as of 09:40, 12 June 2024
scientific article; zbMATH DE number 3365053
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid algorithm for the one machine sequencing problem to minimize total tardiness |
scientific article; zbMATH DE number 3365053 |
Statements
A hybrid algorithm for the one machine sequencing problem to minimize total tardiness (English)
0 references
1971
0 references
