62 research outputs found
A partition‑based branch‑and‑bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
The concept of partially renewable resources provides a general modeling framework that can be used for a wide range of different real-life applications. In this paper, we consider a resource-constrained project duration problem with partially renewable resources, where the temporal constraints between the activities are given by minimum and maximum time lags. We present a new branch-and-bound algorithm for this problem, which is based on a stepwise decomposition of the possible resource consumptions by the activities of the project. It is shown that the new approach results in a polynomially bounded depth of the enumeration tree, which is obtained by kind of a binary search. In a comprehensive experimental performance analysis, we compare our exact solution procedure with all branch-and-bound algorithms and state-of-the-art heuristics from the literature on different benchmark sets. The results of the performance study reveal that our branch-and-bound algorithm clearly outperforms all exact solution procedures. Furthermore, it is shown that our
new approach dominates the state-of-the-art heuristics on well known benchmark instances
A survey of variants and extensions of the resource-constrained project scheduling problem
The resource-constrained project scheduling problem (RCPSP) consists of activities that must be scheduled subject to precedence and resource constraints such that the makespan is minimized. It has become a well-known standard problem in the context of project scheduling which has attracted numerous researchers who developed both exact and heuristic scheduling procedures. However, it is a rather basic model with assumptions that are too restrictive for many practical applications. Consequently, various extensions of the basic RCPSP have been developed. This paper gives an overview over these extensions. The extensions are classified according to the structure of the RCPSP. We summarize generalizations of the activity concept, of the precedence relations and of the resource constraints. Alternative objectives and approaches for scheduling multiple projects are discussed as well. In addition to popular variants and extensions such as multiple modes, minimal and maximal time lags, and net present value-based objectives, the paper also provides a survey of many less known concepts. --project scheduling,modeling,resource constraints,temporal constraints,networks
A general Framework for Utilizing Metaheuristic Optimization for Sustainable Unrelated Parallel Machine Scheduling: A concise overview
Sustainable development has emerged as a global priority, and industries are
increasingly striving to align their operations with sustainable practices.
Parallel machine scheduling (PMS) is a critical aspect of production planning
that directly impacts resource utilization and operational efficiency. In this
paper, we investigate the application of metaheuristic optimization algorithms
to address the unrelated parallel machine scheduling problem (UPMSP) through
the lens of sustainable development goals (SDGs). The primary objective of this
study is to explore how metaheuristic optimization algorithms can contribute to
achieving sustainable development goals in the context of UPMSP. We examine a
range of metaheuristic algorithms, including genetic algorithms, particle swarm
optimization, ant colony optimization, and more, and assess their effectiveness
in optimizing the scheduling problem. The algorithms are evaluated based on
their ability to improve resource utilization, minimize energy consumption,
reduce environmental impact, and promote socially responsible production
practices. To conduct a comprehensive analysis, we consider UPMSP instances
that incorporate sustainability-related constraints and objectives
Incorporating Memory and Learning Mechanisms Into Meta-RaPS
Due to the rapid increase of dimensions and complexity of real life problems, it has become more difficult to find optimal solutions using only exact mathematical methods. The need to find near-optimal solutions in an acceptable amount of time is a challenge when developing more sophisticated approaches. A proper answer to this challenge can be through the implementation of metaheuristic approaches. However, a more powerful answer might be reached by incorporating intelligence into metaheuristics.
Meta-RaPS (Metaheuristic for Randomized Priority Search) is a metaheuristic that creates high quality solutions for discrete optimization problems. It is proposed that incorporating memory and learning mechanisms into Meta-RaPS, which is currently classified as a memoryless metaheuristic, can help the algorithm produce higher quality results.
The proposed Meta-RaPS versions were created by taking different perspectives of learning. The first approach taken is Estimation of Distribution Algorithms (EDA), a stochastic learning technique that creates a probability distribution for each decision variable to generate new solutions. The second Meta-RaPS version was developed by utilizing a machine learning algorithm, Q Learning, which has been successfully applied to optimization problems whose output is a sequence of actions. In the third Meta-RaPS version, Path Relinking (PR) was implemented as a post-optimization method in which the new algorithm learns the good attributes by memorizing best solutions, and follows them to reach better solutions. The fourth proposed version of Meta-RaPS presented another form of learning with its ability to adaptively tune parameters. The efficiency of these approaches motivated us to redesign Meta-RaPS by removing the improvement phase and adding a more sophisticated Path Relinking method. The new Meta-RaPS could solve even the largest problems in much less time while keeping up the quality of its solutions.
To evaluate their performance, all introduced versions were tested using the 0-1 Multidimensional Knapsack Problem (MKP). After comparing the proposed algorithms, Meta-RaPS PR and Meta-RaPS Q Learning appeared to be the algorithms with the best and worst performance, respectively. On the other hand, they could all show superior performance than other approaches to the 0-1 MKP in the literature
Recommended from our members
Scheduling and Resource Efficiency Balancing. Discrete Species Conserving Cuckoo Search for Scheduling in an Uncertain Execution Environment
The main goal of a scheduling process is to decide when and how to execute each of the project’s activities. Despite large variety of researched scheduling problems, the majority of them can be described as generalisations of the resource-constrained project scheduling problem (RCPSP). Because of wide applicability and challenging difficulty, RCPSP has attracted vast amount of attention in the research community and great variety of heuristics have been adapted for solving it. Even though these heuristics are structurally different and operate according to diverse principles, they are designed to obtain only one solution at a time. In the recent researches on RCPSPs, it was proven that these kind of problems have complex multimodal fitness landscapes, which are characterised by a wide solution search spaces and presence of multiple local and global optima.
The main goal of this thesis is twofold. Firstly, it presents a variation of the RCPSP that considers optimisation of projects in an uncertain environment where resources are modelled to adapt to their environment and, as the result of this, improve their efficiency. Secondly, modification of a novel evolutionary computation method Cuckoo Search (CS) is proposed, which has been adapted for solving combinatorial optimisation problems and modified to obtain multiple solutions. To test the proposed methodology, two sets of experiments are carried out. Firstly, the developed algorithm is applied to a real-life software development project. Secondly, the performance of the algorithm is tested on universal benchmark instances for scheduling problems which were modified to take into account specifics of the proposed optimisation model. The results of both experiments demonstrate that the proposed methodology achieves competitive level of performance and is capable of finding multiple global solutions, as well as prove its applicability in real-life projects
Flexible jobshop scheduling problem with resource recovery constraints.
Objectives and methods of study: The general objective of this research is to study a scheduling problem found in a local brewery. The main problem can be seen as a parallel machine batch scheduling problem with sequence-dependent setup times, resource constraints, precedence relationships, and capacity constraints.
In the first part of this research, the problem is characterized as a Flexible Job-shop Scheduling Problem with Resource Recovery Constraints. A mixed integer linear formulation is proposed and a large set of instances adapted from the literatura of the Flexible Job-shop Scheduling Problem is used to validate the model. A solution procedure based on a General Variable Neighborhood Search metaheuristic is proposed, the performance of the procedure is evaluated by using a set of instances adapted from the literature.
In the second part, the real problem is addressed. All the assumptions and constraints faced by the decision maker in the brewery are taken into account. Due to the complexity of the problem, no mathematical formulation is presented, instead, a solution method based on a Greedy Randomize Adaptive Search Procedure is proposed. Several real instances are solved by this algorithm and a comparison is carried out between the solutions reported by our GRASP and the ones found through the procedure followed by the decision maker. The computational results reveal the efficiency of our method, considering both the processing time and the completion time of the scheduling. Our algorithm requires less time to generate the production scheduling (few seconds) while the decision maker takes a full day to do it. Moreover, the completion time of the production scheduling generated by our algorithm is shorter than the one generated through the process followed by the decision maker. This time saving leads to an increase of the production capacity of the company.
Contributions: The main contributions of this thesis can be summarized as follows: i) the introduction of a variant of the Flexible Job-shop Scheduling Problem, named as the Flexible Job-shop Scheduling Problem with Resource Recovery Constraints (FRRC); ii) a mixed integer linear formulation and a General Variable Neighborhood Search for the FRRC; and iii) a case study for which a Greedy Randomize Adaptive Search Procedure has been proposed and tested on real and
artificial instances.
The main scientific products generated by this research are: i) an article already published: Sáenz-Alanís, César A., V. D. Jobish, M. Angélica Salazar-Aguilar, and Vincent Boyer. “A parallel machine batch scheduling problem in a brewing company”. The International Journal of Advanced Manufacturing Technology 87, no. 1-4 (2016): 65-75. ii) another article submitted to the International Journal of Production Research for its possible publication; and iii) Scientific presentations and seminars
A Polyhedral Study of Mixed 0-1 Set
We consider a variant of the well-known single node fixed charge network flow set with constant capacities. This set arises from the relaxation of more general mixed integer sets such as lot-sizing problems with multiple suppliers. We provide a complete polyhedral characterization of the convex hull of the given set
Optimal energy control of a grid connected solar-wind based electric power plant.
Doctor of Philosophy in Electrical Engineering. University of KwaZulu-Natal, Howard College 2016.In the present context of urge energy demand, renewable energy is considered as an alternative source of clean energy. In view of the increase in the price of fossil fuel due to its rarity and emissions, more integration of renewable sources is needed for better economic management of the grid. This research work has been done in two parts. The first part deals with the daily energy consumption variations for the low demand season and high demand season on weekdays and weekends. The intention is to correlate the corresponding fuel cost and estimate the operational efficiency of the hybrid system, which comprises the PV, PW, DG, battery system, for a period of 24 hours taken as control horizon. The latest published research literature has shown that a good deal of work has been done using a fixed load and uniform daily operational cost. The economic dispatch strategy, fuel cost, energy flows and energy sales are analysed in this study. The results show that a renewable energy system, which combines the PV/PW/diesel/battery models, achieves more fuel saving during both the high demand and low demand seasons than a model where the diesel generator satisfies the load on its own. The fuel cost during the low demand and high demand seasons for weekdays and weekends shows considerable fluctuations, which should not be neglected if accurate operational costs are to be obtained. The model shows the achievement of a more practical estimate of fuel costs, which reflects the fluctuation of power consumption behaviour for any given model. In the last part of the thesis model predictive control (MPC) is introduced in the management and control of power flow. The highlight in this thesis is the management of the energy flow from the hydro pump, wind, photovoltaic system and turbine when the system is subject to severe disturbances. The results demonstrated in the thesis prove the advantages of the approach and its robustness against uncertainties and external disturbances. When analysed with the open loop control system, MPC is more robust because of its stability of the system when external disturbances occur in the system. This thesis presents a practical solution to energy sale, control, optimization and management
- …