Filtry
wszystkich: 97
Wyniki wyszukiwania dla: ON-LINE SCHEDULING
-
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)....