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

99 195 (0,823s)

Result

Mathematical Models of Flow Shop and Job Shop Scheduling Problems

. For the job shop scheduling problem, a mathematical model and its main representationIn this paper, mathematical models for permutation flow shop scheduling and job shop sc...

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

  • 2007
  • Jx
Result

GIFFLER AND THOMPSON ALGORITHM FOR FLEXIBLE JOB SHOP PROBLEM

to construct schedule for theoretical Job Shop Scheduling Problem (JSP). However, practical scheduling problems are not that often classical JSP today. This article presents one ofmodifi...

JR - Ostatní strojírenství

  • 2009
  • D
Result

Mathematical Models and Representation Schemes of Manufacturing Processes

. For the job shop scheduling problem, a mathematical model and its main represeentationIn this paper, mathematical models for permutation flow shop scheduling and job shop s...

BC - Teorie a systémy řízení

  • 2006
  • D
Result

Single swap local search for classical Job Shop and Flexible Job Shop scheduling Problem

on theoretical (benchmark) models of both scheduling problems ? classical (JSP) and Flexible Job Shop scheduling Problem (FJSP). Key words:Nowadays, scheduling is becoming most important...

JR - Ostatní strojírenství

  • 2010
  • 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 mean...

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 mean...

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

  • 1999
  • D
Result

Disjunctive Graph-based Representation of Job Shop Scheduling Problem

This work deals with a problem of job shop scheduling. It is a hard combinatorial problem and therefore real-world problems are usually solved by heuristic. These representations arecompared for s...

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

  • 2001
  • 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 t...

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

  • 1999
  • D
Result

Fuzzy Approaches to Flow Shop Scheduling

This paper deals with scheduling problems under uncertainty. Two modifications of the conventional permutation flow shop scheduling problem are studied. The first one treats a case where a due date of each...

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

  • 1999
  • D
Result

Job Shop Scheduling with Transfer Batches

This paper presents a job shop scheduling problem where each job (production batch) can be split into multiple equal-sized transfer batches, which can be moved and structure is the same as in the case of t...

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

  • 2000
  • C
  • 1 - 10 out of 99 195