No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557)
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 5243785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No-wait job shop scheduling: tabu search and complexity of subproblems |
scientific article; zbMATH DE number 5243785 |
Statements
No-wait job shop scheduling: tabu search and complexity of subproblems (English)
0 references
6 March 2008
0 references
Scheduling
0 references
job shop
0 references
no-wait
0 references
decomposition
0 references
complexity
0 references
tabu search
0 references
flow shop
0 references
0 references
0 references
0 references
0 references
0 references
0.9044308662414552
0 references
0.8573611974716187
0 references
0.830178439617157
0 references
