Die Losgrößen- und Ablaufplanung stellt ein in PPS-Systemen wiederholt zu lösendes Problem dar. Wir zeigen zunächst mit Hilfe eines einfachen Beispiels, welche Probleme aus der Vernachlässigung der Abhängigkeiten innerhalb einer mehrstufigen Erzeugnisstruktur entstehen. Anschließend...

This paper deals with lot sizing and scheduling for a single-stage production System where setup costs and times are sequence dependent. A large bücket mixed integer programming (MIP) model is formulated which considers only efficient sequences. A tailor-made enumeration method of the...

Sales force deployment involves the concurrent resolution of four interrelated subproblems: sizing the sales force, salesman location, sales territory alignment, and sales resource allocation. The first subproblem addresses the topic of selecting the appropriate number of salesman. The salesman...

Lotsizing and scheduling comprises activities which have to be done repeatedly within MRP-systems. We consider the proportional (multi-item, capacitated, dynamic) lotsizing and scheduling problem which is more general than the discrete lotsizing and scheduling problem as well as the continuous...

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

This contribution summarizes recent work in the field of lot sizing and scheduling. The objective is not to give a comprehensive literature survey, but to explain differences of formal models and to provide some first readings recommendations. Our focus is on capacitated, dynamic, and...

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

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