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...

We consider the problem of scheduling n jobs in a pallet-constrained two-machine flowshop so as to minimize the makespan. In such a flowshop environment, each job needs a pallet the entire time, from the start of its first operation until the completion of the last operation, and the number of...

Designing optimal products is one of the most critical activities for a firm to stay competitive. Except for genetic algorithms, previous approaches that solve the optimal product line design problem provide the decision maker with a single best solution. Furthermore, they assume a static...

We discuss the performance of scheduling algorithms for a certain kind of manufacturing environment, called the "Flexible Flowshop", which consists of a certain number of machine centers. Each center has one or more identical parallel machines. Each part is processed by at most one machine in...

We are concerned with evolutionary algorithms that are employed for economic modeling purposes. We focus in particular on evolutionary algorithms that use a binary encoding of strategies. These algorithms, commonly referred to as genetic algorithms, are popular in agent-based computational...

We present a mathematical analysis of the long-run behavior of genetic algorithms that are used for modeling social phenomena. The analysis relies on commonly used mathematical techniques in evolutionary game theory. Assuming a positive but infinitely small mutation rate, we derive results that...

The growing demand for electronic devices has made the manufacturing of printed circuit boards (PCBs) a promising industry over the last decades. As the demand for printed circuit boards increases, the industry becomes more dependent on highly automated assembly processes using Surface Mounting...

Alternative machines assignment, machine sharing, and inter-cell movements are very common yet difficult to be solved integratedly in modern dynamic Cellular Manufacturing Systems (CMS). In this paper, we incorporate these issues and consider a dynamic cellular scheduling problem with flexible...

Evolution explains the way the natural world changes over time. It can also explain changes in the artificial world, such as the way ideas replicate, alter, and merge. This analogy has led to a family of related computer procedures called evolutionary algorithms. These algorithms are being used...