Name
Title | ||
|---|---|---|
Minimizing the total flowtime flowshop with blocking using a discrete artificial bee colony |
Abstract | ||
|---|---|---|
This paper considers a discrete artificial bee colony (DABC) algorithm for the blocking flow shop (BFS) scheduling problem to minimize total flowtime. The DABC algorithm utilizes discrete job permutations to represent food sources and applies discrete operators to generate new food sources for the employed bees, onlookers and scouts. First, an initialization scheme based on MME (combination of MinMax and NEH) heuristic is presented to construct an initial population with a certain level of quality and diversity. Second, a local search based on the insertion neighborhood is applied to onlooker stage to improve the algorithm's local exploitation ability. Third, a destruction-construction operator is employed to obtain solutions for the scout bees. Computational simulations and comparisons show that the proposed algorithm (DABC) is effective and efficient for the blocking flow shop scheduling problems with total flowtime criterion. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-25944-9_12 | ICIC (2) |
Keywords | Field | DocType |
total flowtime flowshop,flow shop scheduling problem,local exploitation ability,discrete operator,dabc algorithm,food source,discrete job permutation,flow shop,discrete artificial bee colony,proposed algorithm,local search,blocking,artificial bee colony algorithm | Artificial bee colony algorithm,Population,Heuristic,Mathematical optimization,Job shop scheduling,Computer science,Permutation,Flow shop scheduling,Initialization,Local search (optimization) | Conference |
Volume | ISSN | Citations |
6839 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 8 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu-Yan Han | 1 | 104 | 8.80 |
| Jun-Hua Duan | 2 | 65 | 3.96 |
| Yu-Jie Yang | 3 | 1 | 0.36 |
| Min Zhang | 4 | 9 | 1.59 |
| Bao Yun | 5 | 1 | 0.36 |