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

A flow line consists of a sequence of work places (or stations) through which one or more producta (or models) move one-way in order to be processed. Each model requires specific Operations which must be performed in a predefined Order. To be able to do so, the stations must be equipped with...

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

Gegenstand der vorliegenden Arbeit sind zwei praktisch und theoretisch bedeutsame Probleme, die bei just-in-time orientierter Variantenfließfertigung auftreten. Ein Problem besteht darin, den Teilebedarf in der Endmontage so konstant wie möglich zu halten ("Level Scheduling Problem"). Das...

In this paper an improved set of benchmark instances for the simple assembly line balancing problem is presented. The benchmark set currently available consists of instances with 7 to 297 tasks to be executed. Although claims made in the literature state that instances with up to 1000 tasks can...

While balancing straight assembly lines is a well-studied problem, the Situation where the assembly line has a U-shaped Iayout is a still emerging research field. The advantage of these lines is that workers may simply turn around to operate at two legs of the line. Hence, there is an additional...

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

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

This paper presents a linear programming approach to analyze and optimize flow lines with limited buffer capacities and stochastic processing times. The basic idea is to solve a huge but simple linear program that models an entire simulation run of a multi-stage production process in discrete...