SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531)
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: SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM |
scientific article; zbMATH DE number 5598611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM |
scientific article; zbMATH DE number 5598611 |
Statements
SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (English)
0 references
26 August 2009
0 references
metaheuristics
0 references
open shop
0 references
production management
0 references
scheduling
0 references
0 references
0 references
0 references
0.8558595180511475
0 references
0.8495575785636902
0 references
0.8068799376487732
0 references
0.8042874336242676
0 references
0.8010466694831848
0 references
