Narrow search
Showing 1 - 10 of 365
Cover Image
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Akkan, Can; Drexl, Andreas; Kimms, Alf - 2000
) no more than twenty to fifty activities can be solved to optimality in reasonable amount of time. Hence, heuristics must … be employed to solve larger instances. To evaluate such heuristics, lower bounds are needed. The aim of this paper is to …
Persistent link: https://www.econbiz.de/10011734645
Cover Image
Theory
Sprecher, Arno; Drexl, Andreas - 1996
Persistent link: https://www.econbiz.de/10011806934
Cover Image
Computation
Sprecher, Arno; Drexl, Andreas - 1996
Persistent link: https://www.econbiz.de/10011806935
Cover Image
Solving the RCPSP efficiently at modest memory requirements
Sprecher, Arno - 1996
Persistent link: https://www.econbiz.de/10011787442
Cover Image
Adaptive control schemes for parameterized heuristic scheduling
Schirmer, Andreas - 1998
heuristics do better. In priority rule-based scheduling, attempts to remedy this have been made by combining simple priority …
Persistent link: https://www.econbiz.de/10011737526
Cover Image
Class-based control schemes for parameterized project scheduling heuristics
Schirmer, Andreas; Riesenberg, Sven - 1998
. Priority rule-based methods still constitute the most important class of these heuristics. Of these, in turn, parameterized …
Persistent link: https://www.econbiz.de/10011737256
Cover Image
A competitive exact algorithm for assembly line balancing
Sprecher, Arno - 1997
Persistent link: https://www.econbiz.de/10011787456
Cover Image
Parameterized heuristics for project scheduling : biased random sampling methods
Schirmer, Andreas; Riesenberg, Sven - 1997
Persistent link: https://www.econbiz.de/10011787503
Cover Image
Self-adapting genetic algorithms with an application to project scheduling
Hartmann, Sönke - 1999
This paper introduces a new general framework for genetic algorithms to solve a broad range of optimization problems. When designing a genetic algorithm, there may be several alternatives for a component such as crossover, mutation or decoding procedure, and it may be difficult to determine the...
Persistent link: https://www.econbiz.de/10011734932
Cover Image
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Akkan, Can; Drexl, Andreas; Kimms, Alf - 2000
) no more than twenty to fifty activities can be solved to optimality in reasonable amount of time. Hence, heuristics must … be employed to solve larger instances. To evaluate such heuristics, lower bounds are needed. The aim of this paper is to …
Persistent link: https://www.econbiz.de/10011558760