A filter-and-fan approach to the job shop scheduling problem (Q958547)
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 5378375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A filter-and-fan approach to the job shop scheduling problem |
scientific article; zbMATH DE number 5378375 |
Statements
A filter-and-fan approach to the job shop scheduling problem (English)
0 references
5 December 2008
0 references
heuristics
0 references
local search
0 references
job shop problem
0 references
0 references
0 references
0 references
0.8778444
0 references
0.87267786
0 references
0.8685806
0 references
0.8682179
0 references
0.8679847
0 references
0.8646121
0 references
0 references
0.8614304
0 references
0 references
0.8603452
0 references
