Showing 1 - 10 of 104
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...
Persistent link: https://www.econbiz.de/10011808819
This contribution discusses the measurement of (in-)stability of finite horizon production planning when done on a rolling horizon basis. As examples we review strategic capacity expansion planning, tactical master production schedulng, and operational capacitated lot sizing.
Persistent link: https://www.econbiz.de/10011808833
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...
Persistent link: https://www.econbiz.de/10011738009
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...
Persistent link: https://www.econbiz.de/10011739237
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...
Persistent link: https://www.econbiz.de/10011739277
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...
Persistent link: https://www.econbiz.de/10011739689
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...
Persistent link: https://www.econbiz.de/10011739762
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...
Persistent link: https://www.econbiz.de/10011743231
Persistent link: https://www.econbiz.de/10000827496