Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem (Q1765745)
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: Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem |
scientific article; zbMATH DE number 2137647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem |
scientific article; zbMATH DE number 2137647 |
Statements
Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem (English)
0 references
23 February 2005
0 references
Machine scheduling
0 references
Dynamic shop scheduling
0 references
Mixed-shop
0 references
Group-shop
0 references
Makespan
0 references
Metaheuristics
0 references
0.7935968041419983
0 references
0.789621889591217
0 references
0.7825242280960083
0 references
0.7785981297492981
0 references
0.765378475189209
0 references
