All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

229 268 (0,322s)

Result

Stochastic Heuristic Techniques for Scheduling Job Shops

Job-shop scheduling problems belong to the class of NP-hard problems and therefore exact solution methods can be used only for very simple cases. This paper focuses on solving this problem by means of stochastic heuristic <...

BB - Aplikovaná statistika, operační výzkum

  • 1999
  • D
Result

Stochastic Heuristic Techniques for Scheduling Job Shops

Job-shop scheduling problems belong to the class of NP-hard problems and therefore exact solution methods can be used only for very simple cases. This paper focuses on solving this problem by means of stochastic heuristic <...

JC - Počítačový hardware a software

  • 1999
  • D
Result

Computing Near-Optimal Solutions to the Network Steiner Tree Problem Using Approximate and Heuristic Techniques

approximate and deterministic heuristic methods with stochastic heuristic techniques.

BB - Aplikovaná statistika, operační výzkum

  • 2001
  • D
Result

Optimization of dynamic lot sizes for constrained resources by means of stochastic heuristic methods

methods for solving this problem based on stochastic heuristic methods.

BB - Aplikovaná statistika, operační výzkum

  • 2003
  • D
Result

The Worst Case Analysis by Heuristic Algorithms

The paper is focused on the extreme set of scenarios in stochastic programming. The special genetic algorithm heuristically finds these worst cases....

BA - Obecná matematika

  • 2009
  • D
Result

Scheduling Job Shops Using Genetic Algorithms and Local Search Framework

This paper provides a comparison of the application of stochastic heuristic techniques (genetic algorithms, simulated annealing and tabu search) to job shop scheduling. It presents computational results achieved for three typical re...

BB - Aplikovaná statistika, operační výzkum

  • 1999
  • D
Result

Scenario Generation And Analysis by Heuristic Algorithms

The main purpose of this paper is to present how to use heuristic approaches, especially genetic algorithms, to a scenario manipulation in two-stage stochastic programming. The proposed technique is implemented in C++ and GANS and t...

JC - Počítačový hardware a software

  • 2007
  • D
Result

Stochastic Heuristic Methods for the Steiner Tree Problem in Graphs

presents an application of stochastic heuristic methods in a combination...

BB - Aplikovaná statistika, operační výzkum

  • 2001
  • D
Result

Advanced Genetic Algorithms for Engineering Design Problems

The study of analogy of the natural evolution and the technical object design dates back more than 50 years. The genetic algorithm (GA) is considered to be a stochastic heuristic (or meta-heuristic) optimisation method<...

JC - Počítačový hardware a software

  • 2011
  • Jx
Result

Flow Shop Scheduling Using Stochastic Heuristických Methods

In this paper, we apply three heuristic techniques (simulated annealing, tabu-search, and genetic algorithm) to permutation flowshop scheduling problem with the objective minimizing makespan. Solving some benchmark problems, we examine and c...

JC - Počítačový hardware a software

  • 1999
  • D
  • 1 - 10 out of 229 268