A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967)
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: A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion |
scientific article; zbMATH DE number 6949394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion |
scientific article; zbMATH DE number 6949394 |
Statements
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (English)
0 references
9 October 2018
0 references
artificial bee colony algorithm
0 references
no-idle permutation flowshop scheduling problem
0 references
metaheuristics
0 references
evolutionary algorithms
0 references
genetic algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8368973135948181
0 references
0.8366992473602295
0 references
0.8215252757072449
0 references
0.8006685972213745
0 references
0.7881370186805725
0 references
