This paper investigates the bounds on the expectation of combinatorial optimization given moment information for each individual random variable. A popular approach to solving this problem, known as the marginal moment model (MMM), is to reformulate it as a semidefinite program (SDP). In this paper, we investigate the structure of MMM with up to fourth-order … Read more
To receive a project contract through competitive bidding, contractors submit a bid price determined by putting a markup on the estimated project cost. Since a bid is inevitably affected by an inaccurate cost estimate, sufficient resources should be allocated to cost estimation. This paper develops a novel optimization model for determining the bid markup and … Read more
This paper formalizes and adapts the well known concept of Pareto efficiency in the context of the popular robust optimization (RO) methodology. We argue that the classical RO paradigm need not produce solutions that possess the associated property of Pareto optimality, and illustrate via examples how this could lead to inefficiencies and sub-optimal performance in … Read more
Nowadays, construction projects grow in complexity and size. So, finding feasible schedules which efficiently use scarce resources is a challenging task within project management. Project scheduling consists of determining the starting and finishing times of the activities in a project. These activities are linked by precedence relations and their processing requires one or more resources. … Read more
This paper presents a genetic algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities of the activities are defined by the genetic algorithm. The heuristic generates parameterized active schedules. The approach … Read more
This paper presents a genetic algorithm for the Resource Constrained Multi-Project Scheduling Problem (RCMPSP). The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on … Read more