An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search (Q1374441)
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: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search |
scientific article; zbMATH DE number 1094937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search |
scientific article; zbMATH DE number 1094937 |
Statements
An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search (English)
0 references
6 July 1998
0 references
suboptimal algorithms
0 references
sequencing
0 references
disjunctive graph model
0 references
job-shop scheduling
0 references
makespan
0 references
tabu search
0 references
0.9107831
0 references
0.9025086
0 references
0.90133494
0 references
0.89842826
0 references
0.88978314
0 references
0.88812506
0 references
0.8841097
0 references
0.8826324
0 references
