Hybrid Artificial Bee Colony Algorithm for a Parallel Batching Distributed Flow-Shop Problem With Deteriorating Jobs

2020 ◽  
Vol 50 (6) ◽  
pp. 2425-2439 ◽  
Author(s):  
Jun-Qing Li ◽  
Mei-Xian Song ◽  
Ling Wang ◽  
Pei-Yong Duan ◽  
Yu-Yan Han ◽  
...  
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Flow Shop ◽  
Deteriorating Jobs ◽  
Parallel Batching ◽  
Bee Colony ◽  
Flow Shop Problem

scholarly journals An efficient Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with total flowtime minimization

2015 ◽  
Vol 42 (15-16) ◽  
pp. 6155-6167 ◽  
Author(s):  
Imma Ribas ◽  
Ramon Companys ◽  
Xavier Tort-Martorell
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Flow Shop ◽  
Total Flowtime ◽  
Bee Colony ◽  
Flow Shop Problem

An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system

2019 ◽  
Vol 57 (22) ◽  
pp. 6922-6942 ◽  
Author(s):  
Jun-qing Li ◽  
Shun-Chang Bai ◽  
Pei-yong Duan ◽  
Hong-yan Sang ◽  
Yu-yan Han ◽  
...  
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Flow Shop ◽  
Bee Colony ◽  
Distance Coefficient

scholarly journals An Improved Discrete Artificial Bee Colony Algorithm for Flexible Flowshop Scheduling with Step Deteriorating Jobs and Sequence-Dependent Setup Times

2019 ◽  
Vol 2019 ◽  
pp. 1-13
Author(s):  
Hua Xuan ◽  
Huixian Zhang ◽  
Bing Li
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Deteriorating Jobs ◽  
Setup Times ◽  
Flowshop Scheduling ◽  
Bee Colony ◽  
Flexible Flowshop ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times

This paper studies a flexible flowshop scheduling problem with step-deteriorating jobs and sequence-dependent setup times (FFSP-SDJ&SDST) where there are multiple unrelated parallel machines at each stage. The actual processing time of each job is modeled as a step function of its starting time. An integer programming model is first formulated with the objective of minimizing the total weighted completion time. Since this problem is NP-complete, it becomes an interesting and challenging topic to develop effective approximation algorithms for solving it. The artificial bee colony (ABC) algorithm has been successfully applied to solve both continuous and combinatorial optimization problems with the advantages of fewer control parameters and ease of implementation. So, an improved discrete artificial bee colony algorithm is proposed. In this algorithm, a dynamic generation mechanism of initial solutions is designed based on job permutation encoding. A genetic algorithm and a modified variable neighborhood search are introduced, respectively, to obtain new solutions for the employed and onlooker bees. A greedy heuristic is proposed to generate the solutions of the scout bees. Finally, to verify the performance of the proposed algorithm, an orthogonal test is performed to optimize the parameter settings. Simulation results on different scale problems demonstrate that the proposed algorithm is more effective compared against several presented algorithms from the existing literatures.

A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

2011 ◽  
Vol 181 (12) ◽  
pp. 2455-2468 ◽  
Author(s):  
Quan-Ke Pan ◽  
M. Fatih Tasgetiren ◽  
P.N. Suganthan ◽  
T.J. Chua
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Lot Streaming ◽  
Shop Scheduling ◽  
Bee Colony ◽  
Streaming Flow
Sign in / Sign up

Export Citation Format

Share Document