Minimizing makespan for scheduling stochastic job shop with random breakdown (Q388592)
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: Minimizing makespan for scheduling stochastic job shop with random breakdown |
scientific article; zbMATH DE number 6242374
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing makespan for scheduling stochastic job shop with random breakdown |
scientific article; zbMATH DE number 6242374 |
Statements
Minimizing makespan for scheduling stochastic job shop with random breakdown (English)
0 references
2 January 2014
0 references
stochastic job shop scheduling
0 references
breakdown
0 references
genetic algorithm
0 references
\(\text{Resumable}\) job
0 references
discrete event driven
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8445361256599426
0 references
0.8040558695793152
0 references
0.7978754043579102
0 references
0.7969208359718323
0 references
0.7955874800682068
0 references
