Wyszukiwarka
Filtry
wszystkich: 17
Wyniki wyszukiwania dla: PARALLEL MACHINES
-
Scheduling of compatible jobs on parallel machines
PublikacjaThe dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
PublikacjaIn this paper we consider a problem of job scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. Our research stems from the works of Bodlaender, Jansen, and Woeginger (1994) and Bodlaender and Jansen (1993). In particular, we pursue the...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
PublikacjaIn this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...
-
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
PublikacjaArtykuł podejmuje problem szeregowania zadań przy założeniu podziału czasu na sloty jednakowej długości, gdzie każde z zadań ma ustaloną długość oraz czas jego zakończenia, który jest relatywny do końca slotu. Problem znalezienia uszeregowania polega na dokonaniu przydziału zadań do poszczególnych slotów, przy czym w ogólności długość zadania może wymuszać sytuację, w której zadańie jest realizowane nie tylko w slocie, w którym...
-
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
PublikacjaWe consider the problem of scheduling unit-length jobs on three or four uniform parallel machines to minimize the schedule length or total completion time. We assume that the jobs are subject to some types of mutual exclusion constraints, modeled by a bipartite graph of a bounded degree. The edges of the graph correspond to the pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard,...
-
Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs
PublikacjaThe problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...
-
Planning optimised multi-tasking operations under the capability for parallel machining
PublikacjaThe advent of advanced multi-tasking machines (MTMs) in the metalworking industry has provided the opportunity for more efficient parallel machining as compared to traditional sequential processing. It entailed the need for developing appropriate reasoning schemes for efficient process planning to take advantage of machining capabilities inherent in these machines. This paper addresses an adequate methodical approach for a non-linear...
-
Two Stage SVM and kNN Text Documents Classifier
PublikacjaThe paper presents an approach to the large scale text documents classification problem in parallel environments. A two stage classifier is proposed, based on a combination of k-nearest neighbors and support vector machines classification methods. The details of the classifier and the parallelisation of classification, learning and prediction phases are described. The classifier makes use of our method named one-vs-near. It is...
-
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
PublikacjaThis paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph equivalent to a collection of disjoint cliques. No two jobs in a clique are allowed to be assigned to the same machine. Scheduling with incompatibilities between jobs represents a well-established line of research in scheduling theory and the case of disjoint cliques has received increasing attention in recent...
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublikacjaThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
Investigation of the Effect of The Temperature and Magnetization Pattern on Flux Density, Instantaneous Torque, Unbalanced Magnetic Forces of a Surface Inset PMM
PublikacjaElectrical machines utilized in domestic applications such as ceiling fans should have low losses and cost. Permanent magnets are used instead of rotor excitation to reduce losses. Therefore, not only the losses of the rotor winding are eliminated, but also the efficiency of the machine is increased. A surface inset consequent pole (SICP) machine has also been used to reduce costs. Because less magnets are utilized in this structure....
-
Machines, Computations and Universality (Universal Machines and Computations)
Konferencje -
Influence and development of new kinematic systems in flat surface lapping
PublikacjaThe face grinding and lapping technology is widely used in the field of the precise and ultraprecise manufacturing. It has become an indispensable technology in the manufacture of many parts. An absence of material restrictions allows machining both metal and non-metallic materials, including technical ceramics [1]. Nowadays there are mainly two kinematic systems in lapping machines [2]. The machining plane-parallel surfaces is...
-
Condition-Based Monitoring of DC Motors Performed with Autoencoders
PublikacjaThis paper describes a condition-based monitoring system estimating DC motor degradation with the use of an autoencoder. Two methods of training the autoencoder are evaluated, namely backpropagation and extreme learning machines. The root mean square (RMS) error in the reconstruction of successive fragments of the measured DC motor angular-frequency signal, which is fed to the input of autoencoder, is used to determine the health...
-
International Workshop on Abstract State Machines
Konferencje -
IEEE Symposium on Field Programmable Custom Computing Machines
Konferencje -
International Conference Abstract State Machines, Alloy, B, TLA, VDM, and Z
Konferencje