Similar Search Results

Self-adapting genetic algorithms with an application to project scheduling

Hartmann, Sönke - 1999

. When designing a genetic algorithm, there may be several alternatives for a component such as crossover, mutation or … such cases, we suggest to include alternative components into the genetic algorithm. Indicating the component to be … actually used in the genotype, this allows the genetic algorithm to adapt itself. That is, the genetic algorithm learns which …

Persistent link: https://www.econbiz.de/10011558747

Instrumente zur operativen Entscheidung über Eigenfertigung und Fremdbezug

Sprecher, Arno; Konle, Matthias - 1999

In der vorliegenden Untersuchung wird die operative Entscheidung über Eigenfertigung und Fremdbezug betrachtet. Exemplarisch wird dargelegt, dass klassische Entscheidungshilfen unwirtschaftliche Ergebnisse hervorbringen. Die qualitative und quantitative Fehlspezifikation der Fremdbezugsprodukte...

Persistent link: https://www.econbiz.de/10011558757

Standardization in information systems

Kimms, A. - 2001

On a very abstract level, an information system consists of a set of system elements which communicate with each other. Communication is an unproductive operation, so the time needed to communicate data should be kept as short as possible and, to put it in monetary terms, the opportunity costs...

Persistent link: https://www.econbiz.de/10011558768

A note on capacitated lot sizing with setup carry-over

Briskorn, D. - 2004

use subgradient optimization and a dynamic programming algorithm to solve the corresponding subproblems optimally. The … present paper elucidates that this algorithm does not necessarily provide the optimal solution of the subproblem. Additionally …

Persistent link: https://www.econbiz.de/10011558795

Simulated annealing algorithm for the robust spanning tree problem

Nikulin, Yury - 2005

This paper addresses the robust spanning tree problem with interval data, i.e. the case of classical minimum spanning tree problem when edge weights are not fixed but take their values from some intervals associated with edges. The problem consists in finding a spanning tree that minimizes...

Persistent link: https://www.econbiz.de/10011558802

Solving the robust shortest path problem with interval data using a probabilistic metaheuristic approach

Nikulin, Yury - 2005

This paper addresses the robust shortest path problem with interval data, i.e. the case of classical shortest path problem with given source and sink when arc weights are not fixed but take their values from some intervals associated with arcs. The problem consists in finding a shortest path...

Persistent link: https://www.econbiz.de/10011558808

A new model for the alignment of almost balanced sales territories

Skiera, Bernd; Jordan, Carsten - 1996

The sales territory alignment problem deals with the question of how to align a number of sales coverage units (usually zip-codes or political districts) to sales territories. These sales territories are usually aligned in a way that they are almost balanced relative to one or several attributes...

Persistent link: https://www.econbiz.de/10011583008

New insights on the complexity of resource-constrained project scheduling: A case of single-mode scheduling

Schirmer, Andreas - 1996

Complexity proofs often restrict themselves to stating that the problem at hand is a generalization of some other intractable problem, This proof technique relies on the widely accepted assumptions that complexity results hold regardless of the model formulation used to represent the problem and...

Persistent link: https://www.econbiz.de/10011594619

New insights on the complexity of resource-constrained project scheduling: Two cases of multi-mode scheduling

Schirmer, Andreas - 1996

NP-completeness and other complexity proofs often merely State that the problem at hand is a generalization of some other intractable problem. This proof technique relies on the widely accepted assumption that complexity results hold regardless of the model formulation used to represent the...

Persistent link: https://www.econbiz.de/10011594620

Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities

Haase, Knut; Kimms, Alf - 1996

This paper deals with lot sizing and scheduling for a single-stage production System where setup costs and times are sequence dependent. A large bücket mixed integer programming (MIP) model is formulated which considers only efficient sequences. A tailor-made enumeration method of the...

Persistent link: https://www.econbiz.de/10011594621