Filters
Disjunctive Graph-based Representation of Job Shop Scheduling Problem
representation is important. In this paper two representations are described: the disjunctive graph-based representation and the preference list-based representation......
BB - Aplikovaná statistika, operační výzkum
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
Job Shop Scheduling with Transfer Batches
batches. The presented approach uses a disjunctive graph model, whose size Critical Path Method for computations in this graph. This approach can be integrated into any heuristic method for job shop scheduling which uses t...
BB - Aplikovaná statistika, operační výzkum
- 2000 •
- C
Rok uplatnění
C - Kapitola v odborné knize
Job Shop Scheduling and Its Fuzzification Based on Operations and Disjunctive Graph Representations
benchmarks from ORLibrary. Here, strategies based on operations and disjunctive graph...
Automation and control systems
- 2019 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Lot Streaming in Job Shop Scheduling
of approach,based on a disjunctive graph model and a modification of the Critical Path shop scheduling which uses the disjunctive graph-based representation and the......
BB - Aplikovaná statistika, operační výzkum
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
Modeling Job Shop Scheduling Problem for Real-Life Conditions
This paper describes a model of job shop scheduling, which covers the most frequent conditions of real-life production: assembly and distribution operations, release dates, setup and transfer times, overlapping processes. As a modeling tool we choose...
BB - Aplikovaná statistika, operační výzkum
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
Modelling Uncertainty in Production Scheduling Problems
, the choice of problem representation is important. In this paper the disjunctive graph...
BB - Aplikovaná statistika, operační výzkum
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
An Implementation View on Job Shop Scheduling Based on CPM
, we deal with job shop scheduling problem (JSSP) in a disjunctive graph-based...
BB - Aplikovaná statistika, operační výzkum
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
Incremental Propagation Rules for a Precedence Graph with Optional Activities and Time Windows
Constraint-based scheduling is a powerful tool for solving complex real-life scheduling problems. This paper describes new incremental propagation rules integrating propagation of precedence relations and time windows for activities allocated to a
IN - Informatika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Production Scheduling with Transfer Lots
by means of approach, based on a disjunctive graph and a modification of the Critical...
BB - Aplikovaná statistika, operační výzkum
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
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 representation schem...
BB - Aplikovaná statistika, operační výzkum
- 1999 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 7 753