Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

A Two-stage approach for an optimum solution of the car assembly scheduling problem. Part 2. CLP solution and real-world example

100%

Mazur M. , Niederliński A.

tom Vol. 25, no. 3

367--375

A Constraint Logic Programming (CLP) tool for solving the problem discussed in Part 1 of the paper has been designed. It is outlined and discussed in the paper. The program has been used for solving a real-world car assembly scheduling problem.

A Two-stage approach for an optimum solution of the car assembly scheduling problem Part 1. Problem statement, solution outline and tutorial example

100%

Mazur M. , Niederliński A.

tom Vol. 25, no. 3

355--365

A new approach to solving realistic car assembly scheduling problems for mixed model assembly line is presented. It is proposed to decompose the problem into two subproblems: 1) a sequencing problem that generates admissible car sequences fulfilling capacity constraints for all car models in the production plan, 2) a scheduling problem that determines an admissible car sequence with shortest makespan. The details of this approach are illustrated by a simple numerical example.

Data encryption using N-lag white multisine random time-series

100%

Niederliński A. , Figwer J.

1998

tom Vol. 8, no 3

657-670

A new data encryption method based on N-lag white multisine random time-series (WMRTS) is presented. Its essence is that consecutive characters of the cIeartext are used to generate phase shifts for all or for some of the sine components of an N-lag WMRTS. This time-series is defined in the frequency domain by its Discrete Fourier Transform (DFT). It consists of two spectra: the phase-shift spectrum containing encrypted characters and the amplitude spectrum with the same amplitude for all frequencies. This DFT is calculated with the help of the Fast Fourier Transform (FFT) algorithm transformed into the time domain. The result is the cyphertext in the form of an N-lag WMRTS. To decrypt the cyphertext, it is processed by the FFT algorithm, the result being the original DFT, from which all phase shifts are recovered. The paper presents theoretical foundations of the method and a numerical example demonstrating its effectiveness.