Numerous exact algorithms have been developed for solving the resource-constrained project scheduling problem. Experimental studies have shown that currently even projects with only 60 activities cannot be optimally solved within a reasonable amount of time. Therefore heuristics employing...

This paper introduces a new general framework for genetic algorithms to solve a broad range of optimization problems. When designing a genetic algorithm, there may be several alternatives for a component such as crossover, mutation or decoding procedure, and it may be difficult to determine the...

The sales force deployment problem is considered which arises in many selling organizations. As a solution a novel mixed-integer formulation is introduced which is specifically characterized by an infinite number of variables. A column generation approach is proposed to obtain upper and lower...

This paper considers two problem classes that are important to researchers as well as practitioners, namely packing and project scheduling problems. First, the two problem categories are described. This includes a classification of packing problems as well as of project scheduling concepts....

The staff scheduling problem in the retail business is considered for which a new mathematical model and new solution methods are introduced. The problem is formalized as a set covering type problem. Columns represent feasible weekly working time patterns of one sales clerk. Rows correspond to...

Sales force management decisions belong to the major issues considered in marketing research. Among others, the alignment of sales territories has been one of the main field of work for years. Recent results have reported a strong impact of the alignment of sales territories on profit, and,...

In verschiedenen Modellwelten wird untersucht, ob und inwieweit Kreditrationierung und Risikovermeidung oder -übernahme durch Kreditgeber bei rationalem Verhalten aller Beteiligten erklärt werden kann. Ausgehend von der Erkenntnis, daß auch in einer durch Informationsasymmetrie geprägten...

For most computationally intractable problems there exists no heuristic that is equally effective on all instances. Rather, any given heuristic may do well on some instances but will do worse on others. Indeed, even the 'best' heuristics will be dominated by others on at least some subclasses of...