A Fast Taboo Search Algorithm for the Job Shop Problem (Q4363639): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/mnsc.42.6.797 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/mnsc.42.6.797 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006389447 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MNSC.42.6.797 / rank | |||
Normal rank | |||
Latest revision as of 22:49, 29 December 2024
scientific article; zbMATH DE number 1085179
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fast Taboo Search Algorithm for the Job Shop Problem |
scientific article; zbMATH DE number 1085179 |
Statements
A Fast Taboo Search Algorithm for the Job Shop Problem (English)
0 references
12 November 1997
0 references
approximation algorithm
0 references
minimum makespan
0 references
job shop
0 references
taboo search
0 references
