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

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

Preserving Sparity for General Solution of Linear Diophantine Systems

Copyright c ○ 2013 Mostafa Khorramizadeh. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Here, we present an efficient algorithm for preserveving sparsity in computing the general solution of linear Diophantin systems. In the kth iteration of the algorithm, the general solution k − 1 equations of the systems is at hand. Then, we present numerical results to justify the efficiency of the resulting algorithm