Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (Q1026757)
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: Complete local search with limited memory algorithm for no-wait job shops to minimize makespan |
scientific article; zbMATH DE number 5571300
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complete local search with limited memory algorithm for no-wait job shops to minimize makespan |
scientific article; zbMATH DE number 5571300 |
Statements
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (English)
0 references
29 June 2009
0 references
no-wait
0 references
job shop
0 references
timetabling
0 references
sequencing
0 references
0 references
0 references
0 references
0.89675164
0 references
0.87503314
0 references
0.86631465
0 references
0.8539033
0 references
0.8471112
0 references
0.8423064
0 references
