scholarly journals A Bee Colony Optimization Approach for Mixed Blocking Constraints Flow Shop Scheduling Problems

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Mostafa Khorramizadeh ◽  
Vahid Riahi
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Test Problems ◽  
Optimization Approach ◽  
Scheduling Problems ◽  
Comparative Performance ◽  
Shop Scheduling ◽  
Bee Colony ◽  
Bee Colony Optimization ◽  
Taguchi Orthogonal Arrays

The flow shop scheduling problems with mixed blocking constraints with minimization of makespan are investigated. The Taguchi orthogonal arrays and path relinking along with some efficient local search methods are used to develop a metaheuristic algorithm based on bee colony optimization. In order to compare the performance of the proposed algorithm, two well-known test problems are considered. Computational results show that the presented algorithm has comparative performance with well-known algorithms of the literature, especially for the large sized problems.

Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks

2011 ◽  
Vol 110-116 ◽  
pp. 3914-3921 ◽  
Author(s):  
Hui Mei Wang ◽  
Fuh Der Chou ◽  
Ful Chiang Wu ◽  
Meei Yuh Ku
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Mixed Integer ◽  
Hybrid Flow Shop ◽  
Test Problems ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Mip Model ◽  
Hybrid Flow Shop Scheduling ◽  
Greedy Methods

Hybrid flow shop scheduling problems with multiprocessor tasks to minimize the makespan have been addressed and solved efficiently. Several approaches were used, including greedy methods and metaheuristics. In this paper, we proposed a mixed integer programming (MIP) model that can define explicitly and precisely the nature of a given problem. We also addressed a modified lower bound to obtain tighter bounds. Additionally, we propose different decoding methods and emphasize their importance in hybrid flow shop scheduling problems with multiprocessor tasks. By using existing test problems with n=5 in examining the proposed methods, many optimal solutions can be obtained as benchmarks for reference by the MIP model. Accordingly, the results are indicative of the influence of the decoding methods on the solutions to the hybrid flow shop problems with multiprocessor tasks.

scholarly journals Integrated Optimization Approach of Hybrid Flow-Shop Scheduling Based on Process Set

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 223782-223796
Author(s):  
Xixing Li ◽  
Hongtao Tang ◽  
Zhipeng Yang ◽  
Rui Wu ◽  
Yabo Luo
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Optimization Approach ◽  
Shop Scheduling ◽  
Integrated Optimization ◽  
Hybrid Flow Shop Scheduling

Two-machine flow shop scheduling problems with minimal and maximal delays

4OR ◽  
2006 ◽  
Vol 4 (1) ◽  
pp. 15-28 ◽  
Author(s):  
Jean-Louis Bouquard ◽  
Christophe Lenté
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document