Parallel Taboo Search Techniques for the Job Shop Scheduling Problem (Q4302712): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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.1287/ijoc.6.2.108 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2139910732 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:02, 19 March 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
