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

The discrete lotsizing and scheduling problem for one machine with sequence dependent setup times and setup costs is solved as a single machine scheduling problem, which we term the batch sequencing problem. The relationship between the lotsizing problem and the batch sequencing problem is...

Im Bereich der Entwicklung elektronischer Leitstände werden derzeit große Anstrengungen unternommen, die Produktionsplanung und -steuerung wissensbasiert zu unterstützen. Von besonderem Interesse sind dabei Konzepte und Implementierungen wissensbasierter Leitstände zur Losgrößen-, Termin-...

A batch sequencing model with sequence-dependent setup-times and -costs is used to compare modelling and solving with two different general solvers. "Conceptual models" are implemented in the constraint propagation / logic programming language CHARME and solved with the PROLOG inference engine....

The discrete lotsizing and scheduling problem with setup-times is transformed into a single-machine scheduling problem, denoted as batch sequencing problem, which integrates sequence-dependent setups as well. The relationship between the lotsizing and the batch sequencing problem is analyzed....

Kurze Durchlaufzeiten trotz kundenorientierter, variantenreicher Produktion sind in vielen Branchen Bestandteil einer unverzichtbaren Wettbewerbsstrategie. Da die unterschiedlichen Varianten i.d.R. in Konkurrenz um die verfügbare Kapazität der Fertigungsanlagen stehen, ist ein erhöhter...

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

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

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