Resource-Constrained Project Scheduling with Project Management Information Systems

Most commercial project management software packages include planning methods to devise schedules for resource-constrained projects. As it is proprietary information of the software vendors which planning methods are implemented, the question arises how the software packages differ in quality with respect to their resource-allocation capabilities. We experimentally evaluate the resource-allocation capabilities of eight recent software packages by using 1,560 instances with 30, 60, and 120 activities of the well-known PSPLIB library. In some of the analyzed packages, the user may influence the resource allocation by means of multi-level priority rules, whereas in other packages, only few options can be chosen. We study the impact of various complexity parameters and priority rules on the project duration obtained by the software packages. The results indicate that the resource-allocation capabilities of these packages differ significantly. In general, the relative gap between the packages gets larger with increasing resource scarcity and with increasing number of activities. Moreover, the selection of the priority rule has a considerable impact on the project duration. Surprisingly, when selecting a priority rule in the packages where it is possible, both the mean and the variance of the project duration are in general worse than for the packages which do not offer the selection of a priority rule.

The Resource-Constrained Project Scheduling Problem with Work-Content Constraints

For executing the activities of a project, one or several resources are required, which are in general scarce. Many resource-allocation methods assume that the usage of these resources by an activity is constant during execution; in practice, however, the project manager may vary resource usage by individual activities over time within prescribed bounds. This variation gives rise to the project scheduling problem which consists in allocating the scarce resources to the project activities over time such that the project duration is minimized, the total number of resource units allocated equals the prescribed work content of each activity, and precedence and various work-content-related constraints are met.

Effects of Anxiety on Anticipation and Visual Search in Dynamic, Time-Constrained Situations

We tested the predictions of Attentional Control Theory (ACT) by examining how anxiety affects visual search strategies, performance efficiency, and performance effectiveness using a dynamic, temporal-constrained anticipation task. Higher and lower skilled players viewed soccer situations under 2 task constraints (near vs. far situation) and were tested under high (HA) and low (LA) anxiety conditions. Response accuracy (effectiveness) and response time, perceived mental effort, and eye-movements (all efficiency) were recorded. A significant increase in anxiety was evidenced by higher state anxiety ratings on the MRF-L scale. Increased anxiety led to decreased performance efficiency because response times and mental effort increased for both skill groups whereas response accuracy did not differ. Anxiety influenced search strategies, with higher skilled players showing a decrease in number of fixation locations for far situations under HA compared with LA condition when compared with lower skilled players. Findings provide support for ACT with anxiety impairing processing efficiency and, potentially, top-down attentional control across different task constraints.

On an Application of Microsoft Excel’s Evolutionary Solver to the Resource-Constrained Project Scheduling Problem RCPSP

The Solver Add-in of Microsoft Excel is widely used in courses on Operations Research and in industrial applications. Since the 2010 version of Microsoft Excel, the Solver Add-in comprises a so-called evolutionary solver. We analyze how this metaheuristic can be applied to the resource-constrained project scheduling problem (RCPSP). We present an implementation of a schedule-generation scheme in a spreadsheet, which combined with the evolutionary solver can be used for devising good feasible schedules. Our computational results indicate that using this approach, non-trivial instances of the RCPSP can be (approximately) solved to optimality.

MASCG: Multi-Atlas Segmentation Constrained Graph method for accurate segmentation of hip CT images

This paper addresses the issue of fully automatic segmentation of a hip CT image with the goal to preserve the joint structure for clinical applications in hip disease diagnosis and treatment. For this purpose, we propose a Multi-Atlas Segmentation Constrained Graph (MASCG) method. The MASCG method uses multi-atlas based mesh fusion results to initialize a bone sheetness based multi-label graph cut for an accurate hip CT segmentation which has the inherent advantage of automatic separation of the pelvic region from the bilateral proximal femoral regions. We then introduce a graph cut constrained graph search algorithm to further improve the segmentation accuracy around the bilateral hip joint regions. Taking manual segmentation as the ground truth, we evaluated the present approach on 30 hip CT images (60 hips) with a 15-fold cross validation. When the present approach was compared to manual segmentation, an average surface distance error of 0.30 mm, 0.29 mm, and 0.30 mm was found for the pelvis, the left proximal femur, and the right proximal femur, respectively. A further look at the bilateral hip joint regions demonstrated an average surface distance error of 0.16 mm, 0.21 mm and 0.20 mm for the acetabulum, the left femoral head, and the right femoral head, respectively.

Strategic Behavior in Day-Ahead and Real-Time Markets for Electricity: Offer Cost or Payment Cost Minimization?

This study compares the procurement cost-minimizing and productive efficiency performance of the auction mechanism used by independent system operators (ISOs) in wholesale electricity auction markets in the U.S. with that of a proposed alternative. The current practice allocates energy contracts as if the auction featured a discriminatory final payment method when, in fact, the markets are uniform price auctions. The proposed alternative explicitly accounts for the market clearing price during the allocation phase. We find that the proposed alternative largely outperforms the current practice on the basis of procurement costs in the context of simple auction markets featuring both day-ahead and real-time auctions and that the procurement cost advantage of the alternative is complete when we simulate the effects of increased competition. We also find that a trade-off between the objectives of procurement cost minimization and productive efficiency emerges in our simple auction markets and persists in the face of increased competition.

An Experimental Study of Complex-Offer Auctions: Payment Cost Minimization vs. Offer Cost Minimization

A Payment Cost Minimization (PCM) auction has been proposed as an alternative to the Offer Cost Minimization (OCM) auction to be used in wholesale electric power markets with the intention to lower the procurement cost of electricity. Efficiency concerns about this proposal have relied on the assumption of true production cost revelation. Using an experimental approach, I compare the two auctions, strictly controlling for the level of unilateral market power. A specific feature of these complex-offer auctions is that the sellers submit not only the quantities and the minimum prices at which they are willing to sell, but also the start-up fees that are designed to reimburse the fixed start-up costs of the generation plants. I find that both auctions result in start-up fees that are significantly higher than the start-up costs. Overall, the two auctions perform similarly in terms of procurement cost and efficiency. Surprisingly, I do not find a substantial difference between less market power and more market power designs. Both designs result in similar inefficiencies and equally higher procurement costs over the competitive prediction. The PCM auction tends to have lower price volatility than the OCM auction when the market power is minimal but this property vanishes in the designs with market power. These findings lead me to conclude that both the PCM and the OCM auctions do not belong to the class of truth revealing mechanisms and do not easily elicit competitive behavior.

A Simple Statistical Test of Violation of the Weak Axiom of Cost Minimization

A problem with a practical application of Varian.s Weak Axiom of Cost Minimization is that an observed violation may be due to random variation in the output quantities produced by firms rather than due to inefficiency on the part of the firm. In this paper, unlike in Varian (1985), the output rather than the input quantities are treated as random and an alternative statistical test of the violation of WACM is proposed. We assume that there is no technical inefficiency and provide a test of the hypothesis that an observed violation of WACM is merely due to random variations in the output levels of the firms being compared.. We suggest an intuitive approach for specifying a value of the variance of the noise term that is needed for the test. The paper includes an illustrative example utilizing a data set relating to a number of U.S. airlines.

Efficiency in Deregulated Electricity Markets: Offer Cost Minimization vs. Payment Cost Minimization Auction

This study of the wholesale electricity market compares the efficiency performance of the auction mechanism currently in place in U.S. markets with the performance of a proposed mechanism. The analysis highlights the importance of considering strategic behavior when comparing different institutional systems. We find that in concentrated markets, neither auction mechanism can guarantee an efficient allocation. The advantage of the current mechanism increases with increased price competition if market demand is perfectly inelastic. However, if market demand has some responsiveness to price, the superiority of the current auction with respect to efficiency is not that obvious. We present a case where the proposed auction outperforms the current mechanism on efficiency even if all offers reflect true production costs. We also find that a market designer might face a choice problem with a tradeoff between lower electricity cost and production efficiency. Some implications for social welfare are discussed as well.

A Note on Optimal Care by Wealth-Constrained Injurers

This paper clarifies the relationship between an injurer's wealth level and his care choice by highlighting the distinction between monetary and non-monetary care. When care is non-monetary, wealth-constrained injurers generally take less than optimal care, and care is increasing in their wealth level under both strict liability and negligence. In contrast, when care is monetary, injurers may take too much or too little care under strict liability, and care is not strictly increasing in injurer wealth. Under negligence, the relationship between injurer care and wealth is similar in the two formulations. However, when litigation costs are added to the model, the relationship between injurer care and wealth becomes non-monotonic under both liability rules.

Fourier Series by Least Square Minimization

An introduction to Fourier Series based on the minimization of the least square error between an approximate series representation and the exact function.