Manpower still is one of the most expansive resources, in spite of increasing automation. While employee scheduling and rostering has been the topic of extensive research over the past decades, usually it is assumed that the demand for staff is either given or can be obtained without difficulty....

Manpower still is one of the most expansive resources, in spite of increasing automation. While employee scheduling and rostering has been the topic of extensive research over the past decades, usually it is assumed that the demand for staff is either given or can be obtained without difficulty....

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

In this paper we present a polynomial time dynamic programming algorithm for solving a scheduling problem with a (total) weighted completion time objective function where the weights are activity- and time-dependent. We highlight application areas for this type of problem to underscore the...

This contribution presents an efficient solution method for solving the major short-term planning problems which occur, if lot production has to be managed. In our focus are the two most important aspects, i.e. lot sizing and scheduling. Since both problems heavily interact, we propose an...

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

Gegenstand der vorliegenden Arbeit sind zwei praktisch und theoretisch bedeutsame Probleme, die bei just-in-time orientierter Variantenfließfertigung auftreten. Ein Problem besteht darin, den Teilebedarf in der Endmontage so konstant wie möglich zu halten ("Level Scheduling Problem"). Das...

Resource-constrained project scheduling under a net present value objective attracts growing interest. Because this is an NP-hard problem, it is unlikely that optimum solutions can be computed for large instances. Thus, heuristics have become a popular research field. Up to now, however, tight...