Parallel Taboo Search Techniques for the Job Shop Scheduling Problem (Q4302712): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:34, 6 February 2024
scientific article; zbMATH DE number 622152
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel Taboo Search Techniques for the Job Shop Scheduling Problem |
scientific article; zbMATH DE number 622152 |
Statements
Parallel Taboo Search Techniques for the Job Shop Scheduling Problem (English)
0 references
21 August 1994
0 references
global optimization
0 references
taboo search
0 references
job shop scheduling
0 references
simulated annealing
0 references
polynomial mean time
0 references
