Showing papers by "Peter Brucker published in 2000"
TL;DR: A new destructive lower bound for the resource-constrained project scheduling problem (RCPSP) is presented based on two methods for proving infeasibility of a given threshold value T for the makespan.
116 citations
16 Aug 2000
TL;DR: Crew or staff scheduling is a complex combinatorial problem which consists of assigning tasks to persons which have to perform these task and to schedule the performance of the tasks.
Abstract: Crew or staff scheduling is a complex combinatorial problem. It consists of assigning tasks to persons which have to perform these task and to schedule the performance of the tasks. Railway and airline crew scheduling problems, audit scheduling problems, school and university course scheduling and staff scheduling in hospitals are typical examples of such combinatorial problems.
37 citations
TL;DR: In this article, a chemical batch scheduling problem is modelled in two different ways as a discrete optimization problem and solved in a two-phase tabu search procedure, and the method is tested on real-world data.
Abstract: A chemical batch scheduling problem is modelled in two different ways as a discrete optimization problem. Both models are used to solve the batch scheduling problem in a two-phase tabu search procedure. The method is tested on real-world data.
33 citations
TL;DR: In this article, the authors consider a situation when a task may require both processors simultaneously and present several polynomial time algorithms which complement recent results of Lee and Cai for problems without precedence constraints and show that the introduction of precedence constraints leads to NP-hardness results for maximum lateness and mean flow time objective functions.
Abstract: Problems with unit execution time tasks and two identical parallel processors have received a great deal of attention in scheduling theory. In contrast to the conventional models, where each task requires only one processor, we consider a situation when a task may require both processors simultaneously. For problems without precedence constraints we present several polynomial time algorithms which complement recent results of Lee and Cai. We also show that the introduction of precedence constraints leads to NP-hardness results for maximum lateness and mean flow time objective functions. For the maximum lateness problem, a family of algorithms, based upon the idea of modified due dates, is considered. The worst case behaviour of these algorithms is analysed, and it is shown that the same upper bound is tight for each algorithm of this family.
20 citations