No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557): Difference between revisions
From MaRDI portal
Latest revision as of 21:01, 18 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | No-wait job shop scheduling: tabu search and complexity of subproblems |
scientific article |
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