The Fuzzy Project Scheduling Problem with Minimal Generalized Precedence Relations
نویسندگان
چکیده
منابع مشابه
Modified Pareto archived evolution strategy for the multi-skill project scheduling problem with generalized precedence relations
In this research, we study the multi-skill resource-constrained project scheduling problem, where there are generalized precedence relations between project activities. Workforces are able to perform one or several skills, and their efficiency improves by repeating their skills. For this problem, a mathematical formulation has been proposed that aims to optimize project completion time, reworki...
متن کاملA new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
In this paper we propose a new lower bound for the resource constrained project scheduling problem with generalized precedence relationships. The lower bound is based on a relaxation of the resource constraints among independent activities and on a solution of the relaxed problem suitably represented by means of an AON acyclic network. Computational results are presented and confirmed a better ...
متن کاملMinimizing the Project Cost with Generalized Precedence Relations
Minimizing the project cost is a task of project scheduling, and usually is a starting point in the optimization about cost, for example the time-cost tradeoff is to compress the project duration from the one with minimum cost. Project cost can be minimized by letting all activities choose their minimum cost durations only when strict precedence relations exist between activities. But if genera...
متن کاملMulti-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations
This study addresses the resource-constrained project scheduling problem with precedence relations, and aims at minimizing two criteria: the makespan and the total weighted start time of the activities. To solve the problem, five multi-objective metaheuristic algorithms are analyzed, based on Multi-objective GRASP (MOG), Multiobjective Variable Neighborhood Search (MOVNS) and Pareto Iterated Lo...
متن کاملTwo Customized Parallel Machines Scheduling Problem with Precedence Relations
In this paper, we consider two customized parallel machines scheduling problem with precedence relations to minimize makespan. Complexity and approximation results are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer-Aided Civil and Infrastructure Engineering
سال: 2015
ISSN: 1093-9687
DOI: 10.1111/mice.12166