A priority list based heuristic for the job shop problem (Q4661108)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2151594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A priority list based heuristic for the job shop problem |
scientific article; zbMATH DE number 2151594 |
Statements
A priority list based heuristic for the job shop problem (English)
0 references
4 April 2005
0 references
scheduling
0 references
heuristics
0 references
simulated annealing
0 references
tabu search
0 references
0.8877685070037842
0 references
0.825393795967102
0 references
0.7985197305679321
0 references
0.7984107136726379
0 references
0.7912288308143616
0 references
