A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Tabu search / rank | |||
Normal rank | |||
Revision as of 06:30, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A very fast TS/SA algorithm for the job shop scheduling problem |
scientific article |
Statements
A very fast TS/SA algorithm for the job shop scheduling problem (English)
0 references
10 October 2007
0 references
Job shop scheduling problem
0 references
tabu search
0 references
simulated annealing
0 references
makespan
0 references
