This paper deals with a system where batch arrivals wait in a station until a server (a train) is available, at which moment it services all customers in waiting. This is an example of a bulk server, which has many applications in public transportation, telecommunications, computer resource...

This paper presents a mixed-integer program for the dynamic lot sizing and scheduling problem in a multi-level, single-machine environment. It turns out that in contrast to single-level problems the integration of initial inventory is a crucial aspect if generality should not be lost. It is...

Cellular automata were used to model and to simulate phenomena in the area of physics, biology and medicine. In this paper it is now shown how the idea of cellular automata can be applied to optimization problems as well. As an example a cellular automaton is used as a basis for solving...

This contribution presents two heuristic approaches for multi-level, single-machine lot sizing and scheduling. The first one is a variant of a so-called randomized regret based heuristic which is assumed to be the fastest available method for this particular class of problems. The second...

This contribution deals with dynamic, capacitated, multi-level lot sizing and scheduling. The basic assumption is that for each item there is exactly one machine that this item can be manufactured on but no two items share a common machine. Finding an optimal solution with a greedy algorithm...

This contribution acquaints the reader with a model for multi-level single-machine proportional lot sizing and scheduling problems (PLSPs) that appear in the scope of short-term production planning. It is one of the first papers that deals with dynamic capacitated multi-level lot sizing and...

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 paper explores a single-item capacitated lot sizing problem with minimum order quantity, which plays the role of minor set-up cost. We work out the necessary and suffcient solvability conditions and apply the general dynamic programming technique to develop an O(T³) exact algorithm that is...

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