We review the well-known RSM priority rule to solve the resource constrained project scheduling problem. A detailed analysis of this rule reveals that it is based on assumptions which do not hold in general and hence might lead to poor solutions. Consequently, an improved RSM priority rule is...

This contribution deals with dynamic, capacitated, multi-level lot sizing and scheduling. The basic assumption is that for each item there is exactly one machine that this item can be manufactured on but no two items share a common machine. Finding an optimal solution with a greedy algorithm...

In this paper we propose a new heuristic to solve the well-known multiple resource-constrained project scheduling problem. The method is basically a biased random sampling procedure which shows extremely good results by use of the following features: A problem-based selection of the solution...

This contribution acquaints the reader with a model for multi-level single-machine proportional lot sizing and scheduling problems (PLSPs) that appear in the scope of short-term production planning. It is one of the first papers that deals with dynamic capacitated multi-level lot sizing and...

This paper addresses a general class of nonpreemptive resource-constrained project scheduling problems in which activity durations are discrete functions of committed renewable and nonrenewabe resources. We provide a 0-1 problem formulation and stress the importance of the outlined model by...

We introduce the batch sequencing problem with item and batch availability for the single machine and two machine flow-shop case. We propose a genetic algorithm which solves all variants through a decomposition of the problem into a Phase I-Batching and a Phase II-Scheduling decision. The batch...

Produktionsplanungs- und -steuerungssysteme (PPS-Systeme) haben in den letzten Jahren in der wissenschaftlichen Literatur und der betrieblichen Praxis starke Beachtung gefunden. Während diese Systeme die Problematik der (Groß-) Serienfertigung (einigermaßen) bewältigen, sind sie für die...

Three types of multi-item capacitated dynamic lotsizing and scheduling models are well established until now: The capacitated lotsizing problem, the discrete lotsizing and scheduling problem as well as the continuous setup lotsizing problem. An analysis of the underlying fundamental assumptions...

Zur Lösung des Economic Lot Scheduling Problems (ELSP) finden sich in der Literatur drei Ansätze mit unterschiedlich einschränkenden Annahmen: - Ansatz des gemeinsamen Produktzyklus (Common-Cycle-Approach) - Ansatz der gemeinsamen Basisperiode (Basic-Period-Approach) - Ansatz der variierenden...

Gruppierungs- und Reihenfolgeprobleme der Fertigung zählen zu den zentralen Fragestellungen der (operativen) Produktionsplanung. Gruppierung bezeichnet dabei die zu treffenden Entscheidungen über Größe und zeitliche Lage von Fertigungsaufträgen (Losen), während der Reihenfolgeaspekt die...