Wyszukiwarka
Filtry
wszystkich: 95
Wyniki wyszukiwania dla: ON-LINE SCHEDULING
-
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...
-
CSR (on line)
Kursy Online -
Statystyka Społeczna (on-line)
Kursy Online -
Zachowania organizacyjne (on-line)
Kursy Online -
Zarządzanie strategiczne (wykład on-line)
Kursy Online -
Integracja gospodarcza Europy on-line
Kursy Online -
Zarządzanie strategiczne (ćwiczenia on-line)
Kursy Online -
CSR AG II on line NST
Kursy Online -
DATA MINING NSTAC 2022 ON-LINE
Kursy OnlineNSTAC
-
Bądź on-line edycja marzec 2021
Kursy Online -
NST on line FILOZOFIA AG 2023
Kursy Online -
Koncepcje zarządzania 2023-2024 on-line
Kursy OnlineDzień Dobry, uprzejmie informuję, że zajęcia w trybie on-line, tj. zjazdy od II do VII będą prowadzone z wykorzystaniem Microsoft Teams o adresie: https://teams.microsoft.com/l/meetup-join/19%3ameeting_Y2E2YzAxMzMtOWZmNC00OTM1LThjOTUtMTRhYmUzMjU3NzMz%40thread.v2/0?context=%7b%22Tid%22%3a%2286760356-0022-486f-b793-a2d470bba5a5%22%2c%22Oid%22%3a%227cd26f7c-248f-4764-9dd8-508270807643%22%7d zapraszam i pozdrawiam Krzysztof Leja
-
Wprowadzenie do mikro i makroekonomii ON-LINE
Kursy Online -
Modelowanie procesów w organizacji niestacjonarne on-line
Kursy Online -
WPROWADZENIE DO FINANSÓW (on-line) lato 2023
Kursy Online -
Podstawy projektowania i grafika inżynierska ON-LINE
Kursy Online -
Rachunkowość zarządcza AGII (lato 2024 on-line)
Kursy Online -
NST on line FILOZOFIA Z I 2023
Kursy Online -
Rachunkowość zarządcza ZII (lato 2024 on-line)
Kursy Online -
Konsultacje on-line dr Anny Baj-Rogowskiej
Kursy OnlineZapraszam państwa na konsultacje on-line, które odbywać się będą w semestrze zimowym 2020/2021 w każdą środę w godz. 10:45 - 11:30 na platformie MS Teams. Zalecana przeglądarka to najnowsza wersja Microsoft EDGE lub Google Chrome.
-
Zarządzanie zasobami ludzkimi (AG II niestacjonarne on-line)
Kursy Online -
Analiza ryzyka ekonomicznego (on-line) lato 2024 JW
Kursy OnlineKurs prowadzony przez dr Jarosława Wróblewskiego
-
NST FILOZOFIA ZI/4 on line - 2024 lato
Kursy Online -
Elementy Prawa niestacjonarne 2023- AG, ZI on-line
Kursy Online -
WPROWADZENIE DO FINANSÓW (ON-LINE) sem. letni 2024
Kursy Online -
INFORMATYKA W ZARZĄDZANIU - KURS ON-LINE (ZI, 2022-2023)
Kursy Online -
Fizyka techniczna dla ZiE, zaoczne on-line, 2022/2023
Kursy OnlineFizyka techniczna dla Zarządzania inżynierskiego, zaoczne on-line, sem I
-
NST ETYKA BIZNESU AGII/4 on line - 2024 lato
Kursy Online -
LOGISTYKA (PG_00037973), W/C, WZiE, Zarządzanie 4-semestralne (on-line) - II stopnia semestr 2. oraz Zarządzanie 3-semestralne (on-line) - II stopnia semestr 1.
Kursy OnlineNabycie wiedzy i umiejętności w zakresie zarządzania logistyką.
-
WZiE - AG n. on-line sem.1 - Matematyka 2023/24 (L.M.Kujawski)
Kursy Online -
HISTORIA TRANSPORTU, przedmiot humanistyczny WIMiO on-line, sem 1, zima, 2023/24
Kursy OnlineHISTORIA TRANSPORTU, przedmiot humanistyczny WIMiO wykład on-lineprowadzący: Daniel PIĄTEK
-
Wprowadzenie do rachunkowości (ćw) NIESTACJONARNE LATO 2024 Z II msu 4 sem 1 on-line
Kursy Online -
Statystyka ubezpieczeniowa Analityka gospodarcza (WZiE), II stopnia, niestacjonarne (on-line), 2023/2024 - zimowy (obecnie sem. 2)
Kursy Online -
Systemy informatyczne przedsiębiorstw_lab (NSTACJ. (w tym on-line) ZI I, sem. 4. + AG I, sem. 4.)_lato 2023/24.
Kursy Online -
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...
-
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...
-
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...
-
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...
-
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)....
-
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...
-
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...
-
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.
-
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...
-
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...
-
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...
-
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 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...
-
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,...
-
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....