Showing 1 - 10 of 16,920
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
heuristics do better. In priority rule-based scheduling, attempts to remedy this have been made by combining simple priority … sampling stage; the arising algorithm is almost as effective as the most effective construction methods currently known, and it …
Persistent link: https://www.econbiz.de/10011558738
an NP-hard problem, it is unlikely that optimum solutions can be computed for large instances. Thus, heuristics have … evaluate their heuristics on the basis of a best known lower bound, but it is unclear how good the performance really is. With …
Persistent link: https://www.econbiz.de/10011558745
Sales force management decisions belong to the major issues considered in marketing research. Among others, the alignment of sales territories has been one of the main field of work for years. Recent results have reported a strong impact of the alignment of sales territories on profit, and,...
Persistent link: https://www.econbiz.de/10011558753
will present a general mathematical programming algorithm which can be applied to find an element in the interval core. As …
Persistent link: https://www.econbiz.de/10010421344
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
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
In this paper we propose a new heuristic to solve the well-known multiple resource-constrained project scheduling problem. The method is basically a biased random sampling procedure which shows extremely good results by use of the following features: A problem-based selection of the solution...
Persistent link: https://www.econbiz.de/10011613750
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...
Persistent link: https://www.econbiz.de/10011558728
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...
Persistent link: https://www.econbiz.de/10011558732