Cellular automata were used to model and to simulate phenomena in the area of physics, biology and medicine. In this paper it is now shown how the idea of cellular automata can be applied to optimization problems as well. As an example a cellular automaton is used as a basis for solving...

Am Beispiel eines neuen, auf einer empirischen Erhebung basierenden Ansatzes zur Personaleinsatzplanung in Wirtschaftsprüfiingsgesellschaften wird die Bedeutung der Integration revidierender Planungskonzepte in Ansätze mit hierarchischer Struktur aufgezeigt. Neu nach einem Planungslauf...

We consider the multi-mode resource-constrained project scheduling problem. The focus is on an algorithm which is supposed to find a makespan optimal solution. This algorithm has been presented in a recent paper by Speranza and Vercellis. The correctness of the algorithm is examined. Moreover,...

A new model is presented for capacitated lot-sizing with sequence dependent setup costs. The model is solved heuristically with a backward oriented method; the sequence and lot-size decisions are based on a priority rule which consists of a convex combination of setup and holding costs. A...

Verschiedene Prognosen weisen darauf hin, daß das Markenwertkonzept zu den einflußreichsten Themen der nächsten zehn Jahre innerhalb des Marketings werden wird. Die hier präsentierte Studie untersucht, für welche Zwecke der Markenwert verwendet werden kann, auf welche inhaltlichen...

The discrete lotsizing and scheduling problem with setup-times is transformed into a single-machine scheduling problem, denoted as batch sequencing problem, which integrates sequence-dependent setups as well. The relationship between the lotsizing and the batch sequencing problem is analyzed....

We consider the classical resource-constrained project scheduling problem (RCPSP). The paper gives a detailed algorithmic description and provides theoretical results on two widely known problem specific heuristics: The serial and the parallel scheduling scheme. An in-depth computational study...

This contribution presents two heuristic approaches for multi-level, single-machine lot sizing and scheduling. The first one is a variant of a so-called randomized regret based heuristic which is assumed to be the fastest available method for this particular class of problems. The second...