The car sequencing problem is to find feasible sequences of product variants requiring specific options while taking care of sequencing constraints. First, a branching scheme and constraint propagation algorithms for the computation of feasible sequences are provided. Second, an algorithm is...

Nicht in erster Linie der Stoff macht das Wesen eines Faches aus, sondern das in ihm gepflegte Denken. ... Die Pflege des betriebswirtschaftlichen Denkens ist nach meiner Meinung neben der Forschungsarbeit die wesentliche Aufgabe der akademischen Betriebswirtschaftslehre. Nach unserer Meinung...

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

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

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

In machine tool assembly several make-to-order products have to be manufactured simultaneously in a multi-stage production system. Due to customer requirements batches are very small. A process plan specifies the neccessary machines, tools, auxiliary devices as well as the operations to be...

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

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