R&D cooperation is reconsidered in situations where firms direct R&D activities towards a new product that cannibalizes the firms' existing products. For soft cannibalization, the welfare-maximizing arrangement between firms involves, for low R&D costs, the formation of a separate entity that...

Our companion article developed a clear conceptual framework of negotiated or regulated interconnection agreements between rival operators and studied competition between interconnected networks, under the assumption of non-discriminatory pricing. This article relaxes this assumption and allows...

Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences or feasible subsets, they all aim at finding as fast as possible...

The resource investment problem deals with the issue of providing resources to a project such that a given deadline can be met. The objective is to make the resources available in the cheapest possible way. For each resource, expenses depend on the maximum amount required during the course of...

In project management, the project duration can often be compressed by accelerating some of its activities at an additional expense. This is the so-called time-cost tradeoff problem which has been extensively studied in the past. However, the discrete version of the problem which is of great...

This paper addresses the airport flight gate assignment problem with multiple objectives. The objectives are to maximize the total flight gate preferences, to minimize the number of towing activities and to minimize the absolute deviation of the new gate assignment from a so-called reference...

The paper describes an algorithm for the generation of a general class of precedence- and resource-constrained scheduling problems. Easy and hard instances for the single- and multi-mode resource-constrained project scheduling problem are benchmarked by using the state of the art...

We consider the resource-constrained project scheduling problem (RCPSP). The focus of the paper is on a formal definition of semi-active, active, and non-delay schedules. Traditionally these schedules establish basic concepts within the job shop scheduling literature. There they are usually...

We consider an extension of the classical resource-constrained project scheduling problem (RCPSP), which covers discrete resource-resource and time-resource tradeoffs. As a result a project scheduler is permitted to identify several alternatives or modes of accomplishment for each activity of...

Die Netzplantechnik zählt zu den für die Praxis wichtigsten Gebieten des Operations Research. Insbesondere die Modelle und Methoden der Struktur- und Zeitplanung werden in vielen Fällen mit Erfolg angewendet. Vorgehensweisen der Kosten- und vor allem der Kapazitätsplanung haben jedoch...