Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. (Q1427562)
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: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. |
scientific article |
Statements
Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. (English)
0 references
14 March 2004
0 references
Flowshop
0 references
Scheduling
0 references
Makespan
0 references
Total flowtime
0 references
Heuristics
0 references
Ant-colony algorithm
0 references
