In this paper, open shop scheduling problems with limited machine availability are studied. Such a limited availability of machines may appear in many real-life situations, e.g. as preventive maintenance activities. Three types of jobs are distinguished: non-preemptable, resumable and preemptable. An operation of a resumable job if not completed before a non-availability period of a machine may be suspended and continued without additional cost when the machine becomes available. In the paper, results...
It was conjectured by Fan and Raspaud (1994) that every bridgeless cubic graph contains three perfect matchings such that every edge belongs to at most two of them. We show a randomized algorithmic way of finding Fan-Raspaud colorings of a given cubic graph and, analyzing the computer results, we try to find and describe the Fan-Raspaud colorings for some selected classes of cubic graphs. The presented algorithms can then be applied to the pair assignment problem in cubic computer networks. Another...
In this paper, open shop scheduling problems with limited machine availability
are studied. Such a limited availability of machines may appear in
many real-life situations, as preventive maintenance activities.
Three types of jobs are distinguished: non-preemptable,
resumable and preemptable. An operation of a resumable job if not completed
before a non-availability period of a machine may be suspended and continued
without additional cost when the machine becomes available.
In the paper, results...
BAliBASE is one of the most widely used benchmarks for multiple sequence alignment programs. The accuracy of alignment methods is measured by bali score-an application provided together with the database. The standard accuracy measures are the Sum of Pairs (SP) and the Total Column (TC). We have found that, for non-core block columns, results calculated by bali score are different from those obtained on the basis of the formal definitions of the measures. We do not claim that one of these measures...
Determining amino acid sequences of protein molecules is one of the most important issues in molecular biology. These
sequences determine protein structure and functionality. Unfortunately, direct biochemical methods for reading amino
acid sequences can be used for reading short sequences only. This is the reason, which makes peptide assembly algorithms
an important complement of these methods. In this paper, a genetic algorithm solving the problem of short amino acid sequence
assembly is presented....
Download Results (CSV)