For the first time in computational group theory, parallel disk-based search algorithms are used. These algorithms emphasize streaming access while avoiding the high latency of disk. Search and enumeration is a recurring theme throughout computational group theory. Examples include orbit computation, permutation group membership (permutation group order, random element of a permutation group,et...

In this paper, permutation flow shop scheduling problems (PFSS) are investigated with a genetic algorithm. PFSS problem is special type of problem. problem, there n jobs to be processed on m machines in series. Each job has follow the same machine order and each must process order. The most common performance criterion literature makespan for problems. algorithm applied minimize makespan. Taill...

Permutation is a fundamental operator for array data, with applications in, for example, changing matrix layouts and reorganizing data cubes. We consider the problem of permuting large quantities of data stored on secondary storage that supports fast random block accesses, such as solid state drives and distributed key-value stores. Faster random accesses open up interesting new opportunities f...

INTRODUCTION There has been a surge in the number of vape shops in the USA. Research on the marketing practices of e-cigarette manufacturers is scarce and even less known are the practices of vape shop retailers. Past research on tobacco marketing has shown differences in the amount and content of marketing material, based on a community's demographic profile. This study examined marketing stra...

By the year 2010, the liberalization of Europe's utilities industry has created a dynamic market of production, distribution and reselling organizations where quality of service, personalization and smart marketing, as well as an attentive attitude towards ecology and preservation of resources play a major role. Advancement in information technology in domains such as remote monitoring, communi...

In this paper an ant colony optimization algorithm is developed to solve the permutation flow shop scheduling problem. In the permutation flow shop scheduling problem which has been vastly studied in the literature, there are a set of machines and a set of jobs. All the jobs are processed on all the machines and the sequence of jobs being processed is the same on all the machines. Here this pro...

This paper proposes a penalty-shift-insertion (PSI)-based algorithm for the no-wait flow shop scheduling problem to minimize total flow time. In the first phase, a penalty-based heuristic, derived from Vogel’s approximation method used for the classic transportation problem is used to generate an initial schedule. In the second phase, a known solution is improved using a forward shift heuristic...

Mycobacteria were isolated from defrost water and tissue of sole (Solea solea), hake (Merluccius merluccius), cod (Gadus morhua), ling (Genypterus blacodes), and monkfish (Lophius piscatorius) on Löwenstein-Jensen medium after incubation at different temperatures. Samples of frozen fish were obtained under sterile conditions inside a refrigeration chamber (-18 to -22 degrees C) in a wholesale m...