“A Based-Bee Algorithm Approach for the Multi-Mode Project Scheduling Problem” (original) (raw)

Bees Algorithm for multi-mode, resource-constrained project scheduling in molding industry

Computers & Industrial Engineering, 2017

In a resource-constrained environment project planning and scheduling becomes an extremely complex problem. For real life project schedules multi-mode resource requirements remarkably increase the complexity of and enlarge the respective solution spaces. Therefore schedulers require systematic methodologies compatible with the real world implementations in order to generate cost effective schedules. Similarly, plastic injection molding is known to be a "make-to order" process. The manufacturing of the mold which is a unique and essential component of plastic injection is considered kind of a project. The aim of this study is set to investigate the possibility of utilizing Bees Algorithm for single-resource, multi-mode, resource-constrained mold project scheduling in order to generate a systematic approach to solve the problems of this nature. A Bee-Based Mold Scheduling Model is therefore proposed and employed on a set of problems with different dimensions for the proof of concept. Detail description of an injection molding project together with respective performance analysis is also provided. After the implementation of the proposed methodology, it is well proven that, even for high number of activities and limited resources, the proposed method generates suitable schedules for the projects of this kind the implementation and respective modelling is explained and the results are discussed in detail within the text.

An Artificial Bee Colony Algorithm for the Resource Contrained Project Scheduling Problem

Communications in Computer and Information Science, 2015

We present an approach to solve the Resource Constrained Project Scheduling Problem. This problem consists on executing a group of activities limited by constraints. Precedence relationships force to some activities to begin after the finalization of others. In addition, processing every activity requires a predefined amount of limited resources. The target of this problem is to minimize the duration of whole project. In this paper, an approach based on Artificial Bee Colony algorithm for the Resource Constrained Project Scheduling Problem is presented. That algorithm is one of the most recent algorithms in the domain of the collective intelligence who was motivated by the intelligent behavior observed in the domestic bees to take the process of forage. Thus, ABC combines methods of local search and global search, trying to balance the process of the exploration and exploitation of the space of search.

A Permutation-Based Bees Algorithm for Solving Resource-Constrained Project Scheduling Problem

International Journal of Swarm Intelligence Research, 2019

In this article, a novel Permutation-based Bees Algorithm (PBA) is proposed for the resource-constrained project scheduling problem (RCPSP) which is widely applied in advanced manufacturing, production planning, and project management. The PBA is a modification of existing Bees Algorithm (BA) adapted for solving combinatorial optimization problems by changing some of the algorithm's core concepts. The algorithm treats the solutions of RCPSP as bee swarms and employs the activity-list representation and moves operators for the bees, in association with the serial scheduling generation scheme (Serial SGS), to execute the intelligent updating process of the swarms to search for better solutions. The performance of the proposed approach is analysed across various problem complexities associated with J30, J60 and J120 full instance sets of PSPLIB and compared with other approaches from the literature. Simulation results demonstrate that the proposed PBA provides an effective and effi...

An Enhanced Discrete Bees Algorithm for Resource Constrained Optimization Problems

Inteligencia Artificial

In this paper, we propose a novel efficient model based on Bees Algorithm (BA) for the Resource-Constrained Project Scheduling Problem (RCPSP). The studied RCPSP is a NP-hard combinatorial optimization problem which involves resource, precedence, and temporal constraints. It has been applied to many applications. The main objective is to minimize the expected makespan of the project. The proposed model, named Enhanced Discrete Bees Algorithm (EDBA), iteratively solves the RCPSP by utilizing intelligent foraging behaviors of honey bees. The potential solution is represented by the multidimensional bee, where the activity list representation (AL) is considered. This projection involves using the Serial Schedule Generation Scheme (SSGS) as decoding procedure to construct the active schedules. In addition, the conventional local search of the basic BA is replaced by a neighboring technique, based on the swap operator, which takes into account the specificity of the solution space of proj...