5,243 research outputs found
Formulaciones matemáticas y heurÃsticos simples para solucionar problemas de programación de proyectos con recursos limitados
En este artÃculo se trata el Problema de Programación de Proyectos con Recursos Limitados, más conocido como RCPSP (sigla de Resource Constrained Project Scheduling Problem) -- El RCPSP es un problema proveniente del área de programación de producción y de construcción, aunque sus aplicaciones se extienden a diversas áreas del conocimiento -- En esta investigación se evalúan cinco formulaciones matemáticas diferentes que se encuentran en la literatura, se presenta un heurÃstico simple compuesto por nueve procedimientos de solución independientes y se comparan diferentes propuestas para combinar las soluciones heurÃsticas obtenidas con la formulación que presenta los mejores resultados -- Entre los métodos resultantes se encuentran tanto soluciones exactas como heurÃsticas -- El desempeño de los algoritmos es evaluado utilizando las instancias de la librarÃa PSPLIB de la literatura -- Los resultados obtenidos comprueban que tener buenas soluciones heurÃsticas puede ser útil para acelerar la convergencia de los modelos matemáticos en la búsqueda de soluciones óptimas -- Sin embargo, el uso de nuevas restricciones, añadidas de manera heurÃstica, en los modelos matemáticos no es garantÃa de obtener buenas soluciones ni menores tiempos de cómput
Relevance and Applicability of Multi-objective Resource Constrained Project Scheduling Problem: Review Article
Resource-Constrained Project Scheduling Problem (RCPSP) is a Non Polynomial (NP) - Hard optimization problem that considers how to assign activities to available resources in order to meet predefined objectives. The problem is usually characterized by precedence relationship between activities with limited capacity of renewable resources. In an environment where resources are limited, projects still have to be finished on time, within the approved budget and in accordance with the preset specifications. Inherently, these tend to make RCPSP, a multi-objective problem. However, it has been treated as a single objective problem with project makespan often recognized as the most relevant objective. As a result of not understanding the multi-objective dimension of some projects, where these objectives need to be simultaneously considered, distraction and conflict of interest have ultimately lead to abandoned or totally failed projects. The aim of this article is to holistically review the relevance and applicability of multi-objective performance dimension of RCPSP in an environment where optimal use of limited resources is important
Project scheduling under multiple resources constraints using a genetic algorithm
The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial
optimization for which extensive investigation has been devoted to the development of efficient algorithms.
During the last couple of years many heuristic procedures have been developed for this problem, but still these
procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource
constrained project scheduling problem. The chromosome representation of the problem is based on random
keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the
activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from
the literature and compared with other approaches. The computational results validate the effectiveness of the
proposed algorithm
Intelligent systems in manufacturing: current developments and future prospects
Global competition and rapidly changing customer requirements are demanding increasing changes in manufacturing environments. Enterprises are required to constantly redesign their products and continuously reconfigure their manufacturing systems. Traditional approaches to manufacturing systems do not fully satisfy this new situation. Many authors have proposed that artificial intelligence will bring the flexibility and efficiency needed by manufacturing systems. This paper is a review of artificial intelligence techniques used in manufacturing systems. The paper first defines the components of a simplified intelligent manufacturing systems (IMS), the different Artificial Intelligence (AI) techniques to be considered and then shows how these AI techniques are used for the components of IMS
Recommended from our members
An adaptive memory programming framework for the resource-constrained project scheduling problem
The Resource-Constrained Project Scheduling Problem (RCPSP) is one of the most intractable combinatorial optimisation problems that combines a set of constraints and objectives met in a vast variety of applications and industries. Its solution raises major theoretical challenges due to its complexity, yet presenting numerous practical dimensions. Adaptive memory programming (AMP) is one of the most successful frameworks for solving hard combinatorial optimisation problems (e.g. vehicle routing and scheduling). Its success stems from the use of learning mechanisms that capture favourable solution elements found in high-quality solutions. This paper challenges the efficiency of AMP for solving the RCPSP, to our knowledge, for the first time in the literature. Computational experiments on well-known benchmark RCPSP instances show that the proposed AMP consistently produces high-quality solutions in reasonable computational times
Uma metaheurÃstica para a programação de projectos com multi-modos e recursos limitados
Este artigo apresenta uma nova abordagem (MM-GAV-FBI), aplicável ao
problema da programação de projectos com restrições de recursos e vários modos de execução
por actividade, problema conhecido na literatura anglo-saxónica por MRCPSP. Cada projecto
tem um conjunto de actividades com precedências tecnológicas definidas e um conjunto de
recursos limitados, sendo que cada actividade pode ter mais do que um modo de realização. A
programação dos projectos é realizada com recurso a um esquema de geração de planos
(do inglês Schedule Generation Scheme - SGS) integrado com uma metaheurÃstica. A
metaheurÃstica é baseada no paradigma dos algoritmos genéticos. As prioridades das
actividades são obtidas a partir de um algoritmo genético. A representação cromossómica
utilizada baseia-se em chaves aleatórias. O SGS gera planos não-atrasados. Após a
obtenção de uma solução é aplicada uma melhoria local. O objectivo da abordagem é
encontrar o melhor plano (planning), ou seja, o plano que tenha a menor duração
temporal possÃvel, satisfazendo as precedências das actividades e as restrições de
recursos. A abordagem proposta é testada num conjunto de problemas retirados da
literatura da especialidade e os resultados computacionais são comparados com outras
abordagens. Os resultados computacionais validam o bom desempenho da abordagem,
não apenas em termos de qualidade da solução, mas também em termos de tempo útil.As the complexity of projects increases, the requirement of an organized
planning and scheduling process is enhanced. The need for organized planning and scheduling
of a construction project is influenced by a variety of factors (e.g., project size and number of
project activities). To plan and schedule a construction project, activities must be defined
sufficiently. The level of detail determines the number of activities contained within the
project plan and schedule. So, finding feasible schedules which efficiently use scarce resources is a challenging task within project management. In this context, the well-known
Resource Constrained Project Scheduling Problem (RCPSP) has been studied during the last
decades. In the RCPSP the activities of a project have to be scheduled such that the makespan
of the project is minimized. So, the technological precedence constraints have to be observed
as well as limitations of the renewable resources required to accomplish the activities. Once
started, an activity may not be interrupted. This problem has been extended to a more realistic
model, the multi-mode resource constrained project scheduling problem (MRCPSP), where
each activity can be performed in one out of several modes. Each mode of an activity
represents an alternative way of combining different levels of resource requirements with a
related duration. Each renewable resource has a limited availability such as manpower and
machines for the entire project. The objective of the MRCPSP problem is minimizing the
makespan. While the exact methods are available for providing optimal solution for small
problems, its computation time is not feasible for large-scale problems. This paper presents a
genetic algorithm-based approach (MM-GAV-FBI) for the multi-mode resource constrained
project scheduling problem. The idea of this new approach is integrating a genetic algorithm
with a schedule generation scheme. This study also proposes applying a local search
procedure trying to improve the initial solution. The chromosome representation of the
problem is based on random keys. The schedule is constructed using a schedule generation
scheme (SGS) in which the priorities of the activities are defined by the genetic algorithm.
The experimental results of MM-GAV-FBI on project instances show that this approach is an
effective method for solving the MRCPSP
Resource Tardiness Weighted Cost Minimization in Project Scheduling
In this paper, we study a project scheduling problem that is called resource constrained project scheduling problem under minimization of total weighted resource tardiness penalty cost (RCPSP-TWRTPC). In this problem, the project is subject to renewable resources, each renewable resource is available for limited time periods during the project life cycle, and keeping the resource for each extra period results in some tardiness penalty cost. We introduce a branch and bound algorithm to solve the problem exactly and use several bounding, fathoming, and dominance rules in our algorithm to shorten the enumeration process. We point out parameters affecting the RCPSP-TWRTPC degree of difficulty, generate extensive sets of sample instances for the problem, and perform comprehensive experimental analysis using the customized algorithm and also CPLEX solver. We analyze the algorithm behavior with respect to the changes in instances degree of difficulty and compare its performance for different cases with the CPLEX solver. The results reveal algorithm efficiency
Coil batching to improve productivity and energy utilization in steel production
This paper investigates a practical batching decision problem that arises in the batch annealing operations in the cold rolling stage of steel production faced by most large iron and steel companies in the world. The problem is to select steel coils from a set of waiting coils to form batches to be annealed in available batch annealing furnaces and choose a median coil for each furnace. The objective is to maximize the total reward of the selected coils less the total coil'coil and coil'furnace mismatching cost. For a special case of the problem that arises frequently in practical settings where the coils are all similar and there is only one type of furnace available, we develop a polynomial-time dynamic programming algorithm to obtain an optimal solution. For the general case of the problem, which is strongly NP-hard, an exact branch-and-price-and-cut solution algorithm is developed using a column and row generation framework. A variable reduction strategy is also proposed to accelerate the algorithm. The algorithm is capable of solving medium-size instances to optimality within a reasonable computation time. In addition, a tabu search heuristic is proposed for solving larger instances. Three simple search neighborhoods, as well as a sophisticated variable-depth neighborhood, are developed. This heuristic can generate near-optimal solutions for large instances within a short computation time. Using both randomly generated and real-world production data sets, we show that our algorithms are superior to the typical rule-based planning approach used by many steel plants. A decision support system that embeds our algorithms was developed and implemented at Baosteel to replace their rule-based planning method. The use of the system brings significant benefits to Baosteel, including an annual net profit increase of at least 1.76 million U.S. dollars and a large reduction of standard coal consumption and carbon dioxide emissions
A Survey of Prediction and Classification Techniques in Multicore Processor Systems
In multicore processor systems, being able to accurately predict the future provides new optimization opportunities, which otherwise could not be exploited. For example, an oracle able to predict a certain application\u27s behavior running on a smart phone could direct the power manager to switch to appropriate dynamic voltage and frequency scaling modes that would guarantee minimum levels of desired performance while saving energy consumption and thereby prolonging battery life. Using predictions enables systems to become proactive rather than continue to operate in a reactive manner. This prediction-based proactive approach has become increasingly popular in the design and optimization of integrated circuits and of multicore processor systems. Prediction transforms from simple forecasting to sophisticated machine learning based prediction and classification that learns from existing data, employs data mining, and predicts future behavior. This can be exploited by novel optimization techniques that can span across all layers of the computing stack. In this survey paper, we present a discussion of the most popular techniques on prediction and classification in the general context of computing systems with emphasis on multicore processors. The paper is far from comprehensive, but, it will help the reader interested in employing prediction in optimization of multicore processor systems
- …