We consider a novel generalization of the resource-constrained project scheduling problem (RCPSP). Unlike many established approaches for the RCPSP that aim to minimize the makespan of the project for given static capacity constraints, we consider the important real-life aspect that capacity...

The advance in the global environment, rapidly changing markets, and information technology has created a new stage for design. In such an environment, one strategy for success is the Collaborative Product Development (CPD). Organizing people effectively is the goal of Collaborative Product...

We propose a framework for an ensemble bankruptcy classifier that uses if-then rules to combine the outputs from a heterogeneous set classifiers. A genetic algorithm (GA) induces the rules using an asymmetric, cost-sensitive fitness function that includes accuracy and misclassification costs....

The genetic algorithms are a well-known family of high-performance probabilistic algorithms. In this paper, we explore the possibility of using the genetic algorithm for the Knapsack problem to compromise the security of a Knapsack cipher. Despite being much faster than the exact algorithms, the...

Many, if not most, real-world decision-making problems from operations research/management science are very complex in nature and quite hard to solve by classical optimization techniques. Such problems are often confronted with multi-objective decision-making problems, which involve multiple...