A novel threshold accepting meta-heuristic for the job-shop scheduling problem (Q1885997)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A novel threshold accepting meta-heuristic for the job-shop scheduling problem |
scientific article; zbMATH DE number 2115383
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A novel threshold accepting meta-heuristic for the job-shop scheduling problem |
scientific article; zbMATH DE number 2115383 |
Statements
A novel threshold accepting meta-heuristic for the job-shop scheduling problem (English)
0 references
12 November 2004
0 references
Scheduling
0 references
Job-shop
0 references
Meta-heuristics
0 references
Threshold accepting
0 references
LBTA algorithm
0 references
0 references
0.7644913792610168
0 references
0.7641600966453552
0 references
0.7562986612319946
0 references
0.7477079033851624
0 references
