Wyniki wyszukiwania dla: scheduling
-
JOURNAL OF SCHEDULING
Czasopisma -
Shared processor scheduling
PublikacjaWe study the shared processor scheduling problem with a single shared processor to maximize total weighted overlap, where an overlap for a job is the amount of time it is processed on its private and shared processor in parallel. A polynomial-time optimization algorithm has been given for the problem with equal weights in the literature. This paper extends that result by showing an (log)-time optimization algorithm for a class...
-
Restricted open shop scheduling
PublikacjaIn the real applications the open shop scheduling models often require some additional constraints and adequate models. We concern the restrictions in the open shop scheduling related to an instance of the problem and to a feasible solution. Precisely, we require that each jobs consists of the bounded number of operations and each machine has a bounded load (i.e., the total number of operations executed on this machine in a schedule)....
-
Shared multi-processor scheduling
PublikacjaWe study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order to reduce the job’s completion time due to processing time overlap. The total weighted overlap of all jobs is to be maximized. The problem models subcontracting scheduling in supply chains and divisible load scheduling in computing. We show that synchronized...
-
Parallel scheduling by graph ranking
PublikacjaNr dokum.: 73017Praca dotyczy jednego z nieklasycznych modeli kolorowania grafów - uporządkowanego kolorowania. Celem było uzyskanie wyników, które mogo być wykorzystane w praktycznych zastosowaniach tego modelu, do których należą: równoległe przetwarzanie zapytań w relacyjnych bazach danych, równoległa faktoryzacja macierzy metodą Choleskiego, równoległa asemblacja produktu z jego części składowych. W pracy wskazano uogólnienia...
-
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...
-
Shared processor scheduling of multiprocessor jobs
PublikacjaWe study a problem of shared processor scheduling of multiprocessor weighted jobs. Each job can be executed on its private processor and simultaneously on possibly many processors shared by all jobs. This simultaneous execution reduces their completion times due to the processing time overlap. Each of the m shared processors may charge a different fee but otherwise the processors are identical. The goal is to maximize the total...
-
Genetic ANFIS for scheduling in telecommunication networks
Publikacja -
Chromatic scheduling in a cyclic open shop
PublikacjaPraca jest poświęcona złożoności obliczeniowej problemu cyklicznego szeregowania w systemie otwartym. Autorzy analizując wykazują, że problem jest NP-trudny dla 3 procesorów i konstruują algorytm dokładny dla przypadku dwóch procesorów.Ponadto analizowany jest zwarty wariant cyklicznego systemu otwartego. W tym przypadku autorzy pokazują, że już szeregowanie na dwóch procesorach prowadzi do problemu NP-trudnego.
-
On-Line Partitioning for On-Line Scheduling with Resource Conflicts
PublikacjaWithin this paper, we consider the problem of on-line partitioning the sequence of jobs which are competing for non-sharable resources. As a result of partitioning we get the subsets of jobs that form separate instances of the on-line scheduling problem. The objective is to generate a partition into the minimum number of instances such that the response time of any job in each instance is bounded by a given constant. Our research...
-
Cost approach to the flow-shop construction scheduling
Publikacja -
Web Based Application for Probability Job Scheduling
Publikacja -
Artificial Neural Network for Multiprocessor Tasks Scheduling
Publikacja -
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...
-
Scheduling jobs to contain a natural disaster: a model and complexity
Publikacjathis paper is devoted to the problem of scheduling suppression units so that a natural disaster is dealt with as efficient as possible. the concept of deteriorating jobs is adopted, that is, the formal model of scheduling represents linearly increasing value loss as the disaster remains unsuppressed and increasing time for its suppression. more precisely, two different goals are considered: finding a suppression schedule of minimal...
-
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...
-
A new optimal algorithm for a time-dependent scheduling problem
PublikacjaIn this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs j_1, ..., j_n and the processing time pi of the i-th job is given by p_i = 1 + b_is_i, where si is the starting time of the i-th job, i = 1, ..., n. If all jobs have different and non-zero deterioration rates and bi > bj => bi >= (b_min+1)/(b_min) b_j + 1/b_min, where b_min = min{b_i}, then...
-
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...
-
Dedicated scheduling of tasks to minimize mean flow time
PublikacjaThis paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special cases.
-
Heuristic scheduling algorithms for uniform load of computer system
PublikacjaW pracy zaprezentowano opracowany heurystyczny algorytm szeregowania zadań UNILO (ang. UNIform LOad - jednakowe obciążenie), umożliwiający redukcję całkowitego zapotrzebowania na moc obliczeniową systemu komputerowego bez pogarszania jego wydajności. Algorytm ten realizuje takie przydzielenie zadań obliczeniowych do poszczególnych jednostek (procesorów), aby zapewnić ich jednakowe obciążenie. Opracowany algorytm został zweryfikowany...
-
An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
Publikacja -
Fuzzy Scheduling Problem of Vessels in One-Way Waterway
Publikacja -
Elimination of dominated partial schedules in scheduling deteriorating jobs
Publikacjaw artykule rozważany jest problem szeregowania zadań uwarunkowanych czasowo, w notacji trójpolowej opisywany przez 1 | pi = a + bisi | ?ci. wprowadzona jest koncepcja zdominowanych częściowych harmonogramów oraz przedstawiony jest niewielomianowy algorytm dla problemu, który bazuje na eliminacji zdominowanych częściowych harmonogramów. przedstawione są wyniki eksperymentów obliczeniowych, porównujących zaprezentowany algorytm oraz...
-
Scheduling algorithms for multimedia services in hiperlan/2 networks
PublikacjaW artykule zaprezentowano tradycyjne wykorzystanie oraz nowe metody przydziału pasma użytkownikom lokalnych sieci bezprzewodowych. W szczególności analizowano przydatność dwóch propozycji - algorytmów obsługi strumieni ruchu o zróżnicowanych priorytetach. Propozycje te uwzględniają rezerwację zasobów. Przeprowadzone badanie symulacyjne potwierdziły przydatność obu algorytmów do obsługi ruchu multimedialnego.
-
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...
-
Normal-form preemption sequences for an open problem in scheduling theory
PublikacjaStructural properties of optimal preemptive schedules have been studied in a number of recent papers with a primary focus on two structural parameters: the minimum number of preemptions necessary, and a tight lower bound on shifts, i.e., the sizes of intervals bounded by the times created by preemptions, job starts, or completions. These two parameters have been investigated for a large class of preemptive scheduling problems,...
-
The excitation controller with gain scheduling mechanism for synchronous generator control
PublikacjaThe power systems, including the synchronous generators and power systems networks, are complex nonlinear systems with configuration and parameters which change through time. That leads to electromechanical oscillations occurring in that system. Thus synchronous generator excitation controller must be capable of providing appropriate stabilization signal over broad range of operating conditions and disturbances. In this paper,...
-
The influence of variants of finishing machining on scheduling of shaft components manufacturing
PublikacjaIn the paper variants of technological processes were presented to the study for piston rods and rams of hydraulic cylinders taking issues into consideration scheduling of course of the production in flexible manufacturing cell. At the carried study an attempt of the estimation of the influence of technological variants on the effectiveness to manufacture the flexible manufacturing system on the basis of preliminary schedules of...
-
Energy-Aware Scheduling for High-Performance Computing Systems: A Survey
PublikacjaHigh-performance computing (HPC), according to its name, is traditionally oriented toward performance, especially the execution time and scalability of the computations. However, due to the high cost and environmental issues, energy consumption has already become a very important factor that needs to be considered. The paper presents a survey of energy-aware scheduling methods used in a modern HPC environment, starting with the...
-
Compact Scheduling In Open Shop With Zero-One Time Operations
Publikacja -
NP-hardness of compact scheduling in simplified open and flow shops
Publikacja -
Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors
Publikacja -
Scheduling Repetitive Construction Processes Using the Learning-Forgetting Theory
Publikacja -
A polynomial algorithm for some preemptive multiprocessor task scheduling problems.
Publikacja.
-
Evolution-based scheduling of multiple variant and multiple processor programs
Publikacja -
Evolution-based scheduling of fault-tolerant programs on multiple processors
Publikacja -
Fuzzy logic gain scheduling for non - linear servo tracking
PublikacjaArtykuł zawiera propozycję strojenia jako metodę sterowania serwomechanizmem z silnie nieliniowymi elementami. Serwomechanizm steruje dwoma elementami układu śledzącego zamontowanymi na okręcie znajdującym się w morzu. W układzie występuje tarcie spoczynkowe przy zerowej prędkości oraz nieliniowe tarcie przeciwdziałające ruchowi w każdej z osi układu śledzącego. Zastosowany został podwójny układ sterowania ze sprzężeniem zwrotnym....
-
Study of data scheduling methods in the WiMAX Mobile metropolitan area networks
PublikacjaThe paper discusses basic assumptions of the WiMAX Mobile system. It also presents and analyses the results of simulation tests run for selected data scheduling methods and subcarrier allocation. Based on the test results, the authors have prepared a comparative analysis of two popular data scheduling methods, i.e. WRR and PF, and their own method CDFQ which uses information about the current channel situation for the queuing processes...
-
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:...
-
No-Wait & No-Idle Open Shop Minimum Makespan Scheduling with Bioperational Jobs
PublikacjaIn the open shop scheduling with bioperational jobs each job consists of two unit operations with a delay between the end of the first operation and the beginning of the second one. No-wait requirement enforces that the delay between operations is equal to 0. No-idle means that there is no idle time on any machine. We model this problem by the interval incidentor (1, 1)-coloring (IIR(1, 1)-coloring) of a graph with the minimum...
-
Compact scheduling of zero–one time operations in multi-stage systems
Publikacja -
Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs.
PublikacjaW pracy rozważono problem kolorowania grafów mieszanych, opisujący zagadnienie szeregowania zadań, w którym zależności czasowe zadań mają charakter częściowego porządku lub wzajemnego wykluczania. Dla przypadku, w którym graf zależności jest szeregowo-równoległy, podano algorytm rozwiązujący problem optymalnie w czasie $O(n^3.376 * log n)$.
-
Complixity results on open shop scheduling to minimize total cost of operations
PublikacjaW pracy zaprezentowano serię rezultatów dotyczących złożoności obliczeniowejproblemu szeregowania w systemie otwartym z kryterium łącznego kosztu opera-cji. W ogólności problem jest NP-trudny nawet w przypadku 1-procesorowym.Dlatego zaprezentowano możliwie wiele przypadków szczególnych, które są wie-lomianowe. Są one funkcją długości operacji i struktury grafu konfliktów po-między zadaniami.
-
Compact scheduling of zero-one time operations in multi-stage systems.
PublikacjaRozważamy szeregowanie zwarte na maszynach dedykowanych z zero-jedynkowymi operacjami w modelu otwartym, przepływowym i mieszanym. Harmonogramy zostały zmodelowane przy pomocy pokolorowań krawędzi grafu konfliktów z pewnymi dodatkowymi ograniczeniami. Dowodzimy NP-trudności problemów w przypadku ogólnym oraz prezentujemy przegląd znanych wielomianowych algorytmów szeregujących dla systemów o specyficznej budowie.
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublikacjaWe consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.
-
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
PublikacjaThe problem of scheduling n identical jobs on 4 uniform machines with speeds s1>=s2>=s3>=s4 is considered.The aim is to find a schedule with minimum possible length. We assume that jobs are subject to mutual exclusion constraints modeled by a bipartite incompatibility graph of degree delta. We show that the general problem is NP-hard even if s1=s2=s3. If, however, delta<5 and s1>12s2 s2=s3=s4, then the problem can be solved to...
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublikacjaWe address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
-
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,...
-
A Task-Scheduling Approach for Efficient Sparse Symmetric Matrix-Vector Multiplication on a GPU
PublikacjaIn this paper, a task-scheduling approach to efficiently calculating sparse symmetric matrix-vector products and designed to run on Graphics Processing Units (GPUs) is presented. The main premise is that, for many sparse symmetric matrices occurring in common applications, it is possible to obtain significant reductions in memory usage and improvements in performance when the matrix is prepared in certain ways prior to computation....
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublikacjaIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...
-
Terminal charging scheduling of battery electric buses based on vehicle routing problem
PublikacjaElectric buses are considered to be a viable solution for reducing emission in dense urban areas. However, the greater charging time is a huge challenge for operators. In this paper, charging scheduling method was elaborated based on vehicle routing problem using mixed-integer linear programming model. The main novelty of the paper is the combination of modelling aspect, namely flexible turn sequence and heterogeneous shared charging...
-
Comparison of selected algorithms for scheduling workflow applications with dynamically changing service availability
PublikacjaThis paper compares the quality and execution times of several algorithms for scheduling service based workflow applications with changeable service availability and parameters. A workflow is defined as an acyclic directed graph with nodes corresponding to tasks and edges to dependencies between tasks. For each task, one out of several available services needs to be chosen and scheduled to minimize the workflow execution time and...
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Publikacja -
Simulation Method for Scheduling Linear Construction Projects Using the Learning– Forgetting Effect
Publikacja -
Application of Shuffled Frog-Leaping Algorithm for Optimal Software Project Scheduling and Staffing
Publikacja -
A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
PublikacjaIn this paper a single machine time-dependent scheduling problem with total completion time criterion is considered. There are given n jobs J1,…,Jn and the processing time pi of the ith job is given by pi=a+bisi, where si is the starting time of the ith job (i=1,…,n),bi is its deterioration rate and a is the common base processing time. If all jobs have deterioration rates different and not smaller than a certain constant u>0,...
-
Task Scheduling – Review of Algorithms and Analysis of Potential Use in a Biological Wastewater Treatment Plant
PublikacjaThe idea of task scheduling is to increase the efficiency of a system by minimising wasted time, evenly loading machines, or maximising the throughput of machines. Moreover, the use of appropriate scheduling algorithms often leads to a reduction in the energy costs of the process. Task scheduling problems are found in a variety of industrial areas, and their scale changes significantly depending on the problem. This review shows...
-
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
Publikacja -
Chromatic scheduling of 1- and 2-processor uet tasks on dedicated machines with availability constraints.
PublikacjaRozważono uogólnienie klasycznego szeregowania jednostkowych zadań jedno- i dwuprocesorowych na maszynach dedykowanych. Przyjęty model pozwala na naturalne wprowadzenie wszystkich klasycznych kryteriów optymalizacyjnych dla harmonogramów. Zaproponowano algorytmy wielomianowe dla systemów rzadkich.
-
Better polynomial algorithms for scheduling unit-length jobs with bipartite incompatibility graphs on uniform machines
PublikacjaThe goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|p j = 1, G = bisubquartic|Cmax . The second one is Algorithm 3 which is 4-approximate for the problem Qm|p...
-
Interpretation and modeling of emotions in the management of autonomous robots using a control paradigm based on a scheduling variable
PublikacjaThe paper presents a technical introduction to psychological theories of emotions. It highlights a usable ideaimplemented in a number of recently developed computational systems of emotions, and the hypothesis thatemotion can play the role of a scheduling variable in controlling autonomous robots. In the main part ofthis study, we outline our own computational system of emotion – xEmotion – designed as a key structuralelement in...
-
Guest editorial: learning, scheduling, resource optimization, and evolution in smart artificial systems: challenges and support
Publikacja...
-
Vessel Scheduling Optimization Model Based on Variable Speed in a Seaport with One-Way Navigation Channel
Publikacja -
A model of combined heat and power generating plant with urban heat distribution network for production scheduling
PublikacjaPoruszono zagadnienie związane z pracowaniem harmonogramu produkcji elektrociepłowni. Uwzględniony został wpływ zachowania się miejskiej sieci ciepłowniczej na pracę elektrociepłowni. Możliwe jest również modelowanie współpracy ze zbiornikiem ciepła.
-
International Conference on Automated Planning and Scheduling
Konferencje -
Workshop on Constraint Satisfaction for Planning and Scheduling
Konferencje -
IEEE Symposium on Computational Intelligence in Scheduling
Konferencje -
Workshop on Job Scheduling Strategies for Parallel Processing
Konferencje -
Routing equal-size messages on a slotted ring
PublikacjaAnalizujemy problem routingu wiadomości w sieci slotted ring, biorąc pod uwagę dwa kryteria optymalizacyjne: długość uszeregowania oraz liczbę 'cykli' pracy sieci. Optymalny routing dla wiadomości o rozmiarze k jest silnie NP-trudny, natomiast dla k=q, gdzie q jest rozmiarem sieci, można obliczyć w czsie O(n^2log n) dla pierwszego kryterium. Podajemy również algorytm o czasie działania O(nlog n) oraz o stałym współczynniku dobroci....
-
Marek Kubale prof. dr hab. inż.
OsobyDetails concerning: Qualifications, Experiences, Editorial boards, Ph.D. theses supervised, Books, and Recent articles can be found at http://eti.pg.edu.pl/katedra-algorytmow-i-modelowania-systemow/Marek_KubaleGoogle ScholarSylwetka prof. Marka Kubalego Prof. Marek Kubale pracuje na Wydziale ETI Politechniki Gdańskiej nieprzerwanie od roku 1969. W tym czasie napisał ponad 150 prac naukowych, w tym ponad 40 z listy JCR. Ponadto...
-
Multiple access in ad-hoc wireless LANs with noncooperative stations
PublikacjaA class of contention-type MAC protocols (e.g., CSMA/CA) relies on random deferment of packet transmission, and subsumes a deferment selection strategy and a scheduling policy that determines the winner of each contention cycle. This paper examines contention-type protocols in a noncooperative an ad-hoc wireless LAN setting, where a number of stations self-optimise their strategies to obtain a more-than-fair bandwidth share. Two...
-
Assessing the time effectiveness of trust management in fully synchronised wireless sensor networks
PublikacjaThe paper presents the results of the time effectiveness assessment of the distributed WSN Cooperative Trust Management Method - WCT2M in a fully synchronized Wireless Sensor Network (WSN). First we introduce some basic types of synchronization patterns in WSN based on the idea of sleep scheduling. Then we explain how WCT2M works in the network applying the fully synchronized sleep scheduling pattern. Such networks were subjected...
-
Energy efficient indoor localisation for narrowband internet of things
PublikacjaThere are an increasing number of Narrow Band IoT devices being manufactured as the technology behind them develops quickly. The high co-channel interference and signal attenuation was seen in edge Narrow Band IoT devices make it challenging to guarantee the service quality of these devices. To maximize the data rate fairness of Narrow Band IoT devices, a multi-dimensional indoor localization model is devised, consisting of...
-
Category-Based Workload Modeling for Hardware Load Prediction in Heterogeneous IaaS Cloud
PublikacjaThe paper presents a method of hardware load prediction using workload models based on application categories and high-level characteristics. Application of the method to the problem of optimization of virtual machine scheduling in a heterogeneous Infrastructure as a Service (IaaS) computing cloud is described.
-
Genetic Programming for Workload Balancing in the Comcute Grid System
PublikacjaA genetic programming paradigm is implemented for reliability optimization in the Comcute grid system design. Chromosomes are generated as the program functions and then genetic operators are applied for finding Pareto-suboptimal task assignment and scheduling. Results are compared with outcomes obtained by an adaptive evolutionary algorithm.
-
Dynamic coloring of graphs
PublikacjaDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Partial dominated schedules and minimizing the total completion time of deteriorating jobs
PublikacjaA problem of scheduling deteriorating jobs on a single processor is considered. The processing time of a job is given by a function pi=ai+bisi, where si is the starting time of the job, ai>=0, bi>=0, for i=1,...,n. Jobs are non-preemptive and independent and there are neither ready times nor deadlines. The goal is to minimize the total weighted completion time. We show how to employ the concept of non-dominated schedules to construct...
-
Parallel implementation of background subtraction algorithms for real-time video processing on a supercomputer platform
PublikacjaResults of evaluation of the background subtraction algorithms implemented on a supercomputer platform in a parallel manner are presented in the paper. The aim of the work is to chose an algorithm, a number of threads and a task scheduling method, that together provide satisfactory accuracy and efficiency of a real-time processing of high resolution camera images, maintaining the cost of resources usage at a reasonable level. Two...
-
Integration of Services into Workflow Applications
PublikacjaDescribing state-of-the-art solutions in distributed system architectures, Integration of Services into Workflow Applications presents a concise approach to the integration of loosely coupled services into workflow applications. It discusses key challenges related to the integration of distributed systems and proposes solutions, both in terms of theoretical aspects such as models and workflow scheduling algorithms, and technical...
-
Mieczysław Siemiątkowski dr inż.
Osoby -
Autonomous port management based AGV path planning and optimization via an ensemble reinforcement learning framework
PublikacjaThe rapid development of shipping trade pushes automated container terminals toward the direction of intelligence, safety and efficiency. In particular, the formulation of AGV scheduling tasks and the safety and stability of transportation path is an important part of port operation and management, and it is one of the basic tasks to build an intelligent port. Existing research mainly focuses on collaborative operation between...
-
Studies on the influence of technological variants of finishing machining on flow of parts in flexible manufacturing
PublikacjaIn the article below the problems of influence of variants of finishing processing on flow of machining parts in flexible manufacturing system were presented. The investigations were carried out the technological processes for piston rods and rams of hydraulic cylinders. There were also presented model variants of technological processes for piston rods finished with the burnishing. In these studies the influence of technological...
-
Performance Evaluation of the Parallel Codebook Algorithm for Background Subtraction in Video Stream
PublikacjaA background subtraction algorithm based on the codebook approach was implemented on a multi-core processor in a parallel form, using the OpenMP system. The aim of the experiments was to evaluate performance of the multithreaded algorithm in processing video streams recorded from monitoring cameras, depending on a number of computer cores used, method of task scheduling, image resolution and degree of image content variability....
-
Two Time-Scale Hierarchical Control of Integrated Quantity and Quality in Drinking Water Distribution Systems
PublikacjaThe paper considers a feedback optimising control of drinking water distribution systems (DWDS). Although the optimised pump and valves scheduling and disinfectant injection control attracted considerable attention over last two decades most of the contributions were limited to an open-loop optimisation repetitively performed during the DWDS operation. Also, while a strong interaction between the water quantity and quality exists...
-
Decisional DNA based intelligent knowledge model for flexible manufacturing system
PublikacjaModeling an effective mechanism for design and control strategies for the implementation of a flexible manufacturing system (FMS) has been a challenge. Consequently, to overcome this issue various techniques have applied in the past but most of these models are effective only for some specific situation or an element of FMS. In this study, the knowledge representation technique of Decisional DNA (DDNA) is applied to FMS to develop...
-
Computational Approaches to Modeling Artificial Emotion – An Overview of the Proposed Solutions
PublikacjaCybernetic approach to modeling artificial emotion through the use of different theories of psychology is considered in this paper, presenting a review of twelve proposed solutions: ActAffAct, FLAME, EMA, ParleE, FearNot!, FAtiMA, WASABI, Cathexis, KARO, MAMID, FCM, and xEmotion. The main motivation for this study is founded on the hypothesis that emotions can play a definite utility role of scheduling variables in the construction...
-
Electricity demand prediction by multi-agent system with history-based weighting
PublikacjaEnergy and load demand forecasting in short-horizons, over an interval ranging from one hour to one week, is crucial for on-line scheduling and security functions of power system. Many load forecasting methods have been developed in recent years which are usually complex solutions with many adjustable parameters. Best-matching models and their relevant parameters have to be determined in a search procedure. We propose a hybrid...
-
CONTROL OF THE WAVES IN A TOWING TANK WITH THE USE OF A BLACK-BOX MODEL
PublikacjaThe paper describes an adaptive control system of the waves, implemented in the Ship Design and Research Centre, CTO S.A. The purpose of generating the waves in the towing tank is the modelling of the environmental conditions during hydrodynamic model tests. The tests are performed on scale models of towed or free running ships, anchored structures like oil rigs or bottommounted structures, e.g. wind turbines. In the towing tank...
-
Energy-Aware High-Performance Computing: Survey of State-of-the-Art Tools, Techniques, and Environments
PublikacjaThe paper presents state of the art of energy-aware high-performance computing (HPC), in particular identification and classification of approaches by system and device types, optimization metrics, and energy/power control methods. System types include single device, clusters, grids, and clouds while considered device types include CPUs, GPUs, multiprocessor, and hybrid systems. Optimization goals include various combinations of...
-
Opportunities and challenges for exploiting drones in agile manufacturing systems
PublikacjaDrones have become an advanced supply chain implementation instrument, especially in connecting warehouses to outlet points or even individual customers. However, their potential application in an intra-logistics framework has not been studied, let alone explored so far. Modeling and simulations in virtual environments can help explore and evaluate the opportunities for practical and profitable applications of drones in manufacturing...
-
Network-aware Data Prefetching Optimization of Computations in a Heterogeneous HPC Framework
PublikacjaRapid development of diverse computer architectures and hardware accelerators caused that designing parallel systems faces new problems resulting from their heterogeneity. Our implementation of a parallel system called KernelHive allows to efficiently run applications in a heterogeneous environment consisting of multiple collections of nodes with different types of computing devices. The execution engine of the system is open for...
-
KernelHive: a new workflow-based framework for multilevel high performance computing using clusters and workstations with CPUs and GPUs
PublikacjaThe paper presents a new open-source framework called KernelHive for multilevel parallelization of computations among various clusters, cluster nodes, and finally, among both CPUs and GPUs for a particular application. An application is modeled as an acyclic directed graph with a possibility to run nodes in parallel and automatic expansion of nodes (called node unrolling) depending on the number of computation units available....
-
Application of Smart IoT Technology in Project Management Scenarios
PublikacjaThe report presents a low-cost and flexible solution to control and monitor home and industrial appliances. The popularity of automation devices has increased greatly in recent years due to higher affordability and simplicity through IoT phone and tablet connectivity. For this purpose, we have developed the IoT Outlet: a stand-alone communication unit, used to connect outlets to the internet. The IoT Plug is a power switch which...
-
Generation of large finite-element matrices on multiple graphics processors
PublikacjaThis paper presents techniques for generating very large finite-element matrices on a multicore workstation equipped with several graphics processing units (GPUs). To overcome the low memory size limitation of the GPUs, and at the same time to accelerate the generation process, we propose to generate the large sparse linear systems arising in finite-element analysis in an iterative manner on several GPUs and to use the graphics...
-
Potential for ITS/ICT Solutions in Urban Freight Management
PublikacjaThe article presents a study on applying ITS solutions in planning and management of urban freight transport in Gdynia. The traffic management system Tristar which is under implementation and its related systems show a potential to assist in development of freight transport measures. Recommendations for urban freight policy development supplementing Gdynia's Sustainable Urban Mobility Plan were used as a basis for identification...
-
Badanie wpływu strategii sterowania obiegiem narzędzi na wydajność elastycznego systemu wytwarzania.
PublikacjaPrzedmiotem rozprawy doktorskiej są badania wpływu strategii sterowania obiegiem narzędzi na wydajność elastycznego systemu wytwarzania. Obiektem badań było elastyczne gniazdo obróbkowe wyposażone w trzy poziome frezarsko-wytaczarskie centra obróbkowe przeznaczone do wytwarzania części klasy korpus. Wybrane strategie przydziału operacji technologicznych i adekwatnych zestawów narzędziowych poddano analizie i ocenie wg przyjętych...
-
Optimal edge-coloring with edge rate constraints
PublikacjaWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Smart Decisional DNA Technology to Enhance Industry 4.0 Environment in Conjunction with Conventional Manufacturing
PublikacjaKnowledge-based support has become an indispensable part not only to the traditional manufacturing set-ups but also to the new fast-emerging Industry 4.0 scenario. In this regard, successful research has been performed and extensively reported to develop Decisional DNA based knowledge representation models of engineering object and engineering process called Virtual engineering object (VEO), Virtual engineering process (VEP) and...
-
Operation of the Hybrid Photovoltaic-Battery System on the Electricity Market—Simulation, Real-Time Tests and Cost Analysis
PublikacjaThis paper presents research on a hybrid photovoltaic-battery energy storage system, declaring its hourly production levels as a member of a balancing group submitting common scheduling unit to the day-ahead market. It also discusses the variability of photovoltaic system generation and energy storage response. The major research questions were whether the operation of a hybrid photovoltaic-battery energy storage system is viable...