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

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

In facility layout problems, a major concern is the optimal design or remodeling of the facilities of an organization. The decision maker's objective is to arrange the facility in an optimal way, so that the interaction among functions (i.e. machines, inventories, persons) and places (i.e....

This paper analyzes how the qualitative change in human labor occurs in mutual dependence with the advancement of the epistemic base of technology. Historically, a recurrent pattern can be identified: humans learned to successively transfer labor qualities to machines. The subsequent release of...

This paper aims at proposing a first theoretical framework for studying the basic income sustainability. We consider the basic income not only as a tool of a policy to improve living standards and social well-being but, mostly, as the essential requisite to introduce a new stable compromise...

One of the basic assumptions of the classical dynamic lot-sizing model is that theaggregate demand of a given period must be satisfied in that period. Under thisassumption, if backlogging is not allowed then the demand of a given period cannotbe delivered earlier or later than the period. If...

The problem of scheduling multiple, large scale, make-to-order assemblies is considered. Beside "classical" precedence- and resource constraints as known from resource constrained project scheduling we take spatial resource and part availability constraints into account. The objective is to...

We consider the problem of scheduling multiple, large-scale, make-to-order assemblies under resource, assembly area, and part availability constraints. Such problems typically occur in the assembly of high volume, discrete make-to-order products. Based on a list scheduling procedure which has...

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