No abstract

No abstract

This paper presents a discrete bee colony algorithm for solving the blocking flow shop scheduling problem with makespan criterion. Based on the idea of iterated greedy algorithm, some new schemes for employed bee, onlooker bee and scout bee are designed. The performance of the proposed algorithm is tested on the well-known benchmark set of Taillard, and the computational results validate the effectiveness of the discrete bee colony algorithm in comparison with two recently proposed state-of-the-art algorithms. In addition, some new best known solutions for the benchmark set are provided for the considered problem. Index Terms -Flow shop scheduling, blocking, artificial bee colony algorithm, makespan

No abstract

The scheduling problems have been discussed in the literature extensively under the assumption that the machines are permanently available without any breakdown. However, in the real manufacturing environments, the machines could be unavailable inevitably for many reasons. In this paper, the authors introduce the hybrid flowshop scheduling problem with random breakdown (RBHFS) together with a discrete group search optimizer algorithm (DGSO). In particular, two different working cases, preempt-resume case, and preempt-repeat case are considered under random breakdown. The proposed DGSO algorithm adopts the vector representation and several discrete operators, such as insert, swap, differential evolution, destruction, and construction in the producers, scroungers, and rangers phases. In addition, an orthogonal test is applied to configure the adjustable parameters in the DGSO algorithm. The computational results in both cases indicate that the proposed algorithm significantly improves the performances compared with other high performing algorithms in the literature.