Showing 1 - 10 of 12,520
known to be NP-hard, heuristics have become a main research interest. Unfortunately, there has not been done much research …
Persistent link: https://www.econbiz.de/10011558787
In 1997 two papers_new applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) tothe p …
Persistent link: https://www.econbiz.de/10010324381
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
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
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
Generating a regular season schedule is a demanding task for any sports league. In Europe, the creation of a suitable schedule for every national top soccer league not only has to address numerous conflicting inner-league requirements and preferences. Additionally, the games of the European Cup...
Persistent link: https://www.econbiz.de/10011558779
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
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
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