Showing 1 - 10 of 12,441
technique to develop an O(T³) exact algorithm that is based on the concept of minimal sub-problems. An investigation of the … their optimality. In this way, we reduce the complexity of the algorithm considerably and confirm its efficiency in an …
Persistent link: https://www.econbiz.de/10010302566
algorithm based on the concept of minimal sub-problems. We present an optimal solution to a minimal sub-problem in an explicit … tests and the comparison with the published algorithm confirm the efficiency of the solution algorithm developed here. …
Persistent link: https://www.econbiz.de/10010302558
We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated, in the presence of production capacities and for different transportation cost functions. The model we study is a generalization of the traditional single-item economic...
Persistent link: https://www.econbiz.de/10010324804
The paper deals with the analysis of a special dynamic production and inventory model. In this model logical restrictions to fulfill an accepted constant minimal level of the production lot size are incorporated, instead of keeping setup cost in the objective function, as it is common in many...
Persistent link: https://www.econbiz.de/10010297260
This contribution presents an efficient solution method for solving the major short-term planning problems which occur, if lot production has to be managed. In our focus are the two most important aspects, i.e. lot sizing and scheduling. Since both problems heavily interact, we propose an...
Persistent link: https://www.econbiz.de/10011558736
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/10011594606
furthermore give an outline of a proof that any genetic algorithm can be interpreted as a cellular automaton. …
Persistent link: https://www.econbiz.de/10011613734
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/10011613745
. Finding an optimal solution with a greedy algorithm turns out to be an easy task. …
Persistent link: https://www.econbiz.de/10011613748
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/10011613751