Filters
total: 1108
-
Catalog
displaying 1000 best results Help
Search results for: SMART SCHEDULING
-
Smart city - miasto oszczędne
PublicationPublikacja prezentuje koncepcję smart city oraz smart growth.
-
Smart Services for Improving eCommerce
PublicationThe level of customer support provided by the existing eCom-merce solutions assumes that the person using the functionality of theshop has sufficient knowledge to decide on the purchase transaction. Alow conversion rate indicates that customers are more likely to seekknowledge about the particular product than finalize the transaction.This is facilitated by the continuous development of customers’ digi-tal...
-
Compact Scheduling In Open Shop With Zero-One Time Operations
Publication -
NP-hardness of compact scheduling in simplified open and flow shops
Publication -
Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors
Publication -
Evolution-based scheduling of multiple variant and multiple processor programs
Publication -
Evolution-based scheduling of fault-tolerant programs on multiple processors
Publication -
The influence of variants of finishing machining on scheduling of shaft components manufacturing
PublicationIn 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...
-
The excitation controller with gain scheduling mechanism for synchronous generator control
PublicationThe 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,...
-
Normal-form preemption sequences for an open problem in scheduling theory
PublicationStructural 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,...
-
Scheduling Repetitive Construction Processes Using the Learning-Forgetting Theory
Publication -
A polynomial algorithm for some preemptive multiprocessor task scheduling problems.
Publication.
-
Fuzzy logic gain scheduling for non - linear servo tracking
PublicationArtykuł 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....
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublicationThe 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...
-
Energy-Aware Scheduling for High-Performance Computing Systems: A Survey
PublicationHigh-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...
-
Power Electronics Building Blocks for implementing Smart MV/LV Distribution Transformers for Smart Grid
PublicationWith an observed increase in the involvement of active consumers in activities aimed at improving energy efficiency and increasing interest in producing energy from renewable sources, there is a need for the development of new technologies enabling the distribution network operators to offer new services and functionalities. Smart MV/LV distribution transformers are characterized by a compact three-stage design, including an...
-
Performance Analysis of Interaction between Smart Glasses and Smart Objects Using Image-Based Object Identification
PublicationWe propose the use of smart glasses to collaborate with smart objects in the Internet of Things environment. Particularly we are focusing on new interaction methods and the analysis of acceptable reaction times in the process of object recognition using smart glasses. We evaluated the proposed method using user studies and experiments with three different smart glasses: Google Glass, Epson Moverio, and the developed eGlasses platform....
-
Compact scheduling of zero–one time operations in multi-stage systems
Publication -
Study of data scheduling methods in the WiMAX Mobile metropolitan area networks
PublicationThe 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...
-
No-Wait & No-Idle Open Shop Minimum Makespan Scheduling with Bioperational Jobs
PublicationIn 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...
-
Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs.
PublicationW 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)$.
-
Compact scheduling of zero-one time operations in multi-stage systems.
PublicationRozważ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.
-
Complixity results on open shop scheduling to minimize total cost of operations
PublicationW 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.
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
PublicationIn 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:...
-
Systemy Smart Cities - studium przypadku
PublicationThe paper presents the architecture of an enterprise service bus used in the construction of information systems processing large amounts of data for decision-making needs at the City Hall in Gdańsk. The key concept of processes of bus development involves installation of developing environment, database connection, flow mechanisms and data presentation. The issue was supported by models such as KPI (Key Processes Identifier) and...
-
Smart skills and education in a future economy
PublicationWhether the role of education is to prepare people for employment or to have meaningful lives in general, it will identify and develop skills and competencies, as well as vocational and personal attributes. Skills, such as critical thinking, novel ideation, and complex cognitive and social skills, are areas where humans continue to outperform smart machines. The purpose of this article is to review the skills and competencies that...
-
Smart Email - Almost an Agent Platform
PublicationNetwork organizations suffer today of information overload and strain that rise their operational costs. One of the reasons of that is the dominance of email messaging as the princi-pal means of document exchange between their workers. Proac-tive documents can rationalize these costs and augment email systems with a process view based on collaboration patterns.
-
Smart sustainable cities : Reconnaissance Study
PublicationThe global urban population is expected to grow by 63 percent between 2014 and 2050 – compared to an overall global population growth of 32 percent during the same period. Megacities with over 20-million inhabitants will see the fastest increase in population – and at least 13 new megacities are expected by 2030, in addition to the 28 existing today. The fastest growing urban centres contain around one-million inhabitants, and...
-
An Overview of Sport and the Future Smart Cities
PublicationOne of the main challenges for future cities is to strengthen the role of people and their activities. Therefore, sport provides an opportunity to engage in physical activity, connecting citizens to the city. The question of how sport influences the development of cities and the concept of future smart cities arises. The aim of this study is to examine the relationship between sport and the concept of smart cities by identifying...
-
The role of sport in the Smart City concept
PublicationSport brings to cities innovative solutions that influence urban life, yet considerations about sport still rarely contribute to the development of the very popular smart city concept. This raises the question: what is the perception of sport in the city from the perspective of the smart city concept? One of the challenges of future urban policy is to provide initiatives that ensure the wellbeing and promote the model of a healthy...
-
Towards a Smart Sustainable City Roadmap
PublicationThis workshop of the CAP4CITY (Erasmus+ Strengthening Governance Capacity for Smart Sustainable Cities) project is to promote and stimulate the discussion and networking in the area of Digital Government. Smart Sustainable Cities and related concepts of Digital, Intelligent and Smart Cities represent a progression of how cities around the world apply digital technology to serve their populations, pursue sustainable socio-economic...
-
EXPERIENCE-ORIENTED SMART EMBEDDED SYSTEM
PublicationThe Experience-Oriented Smart Embedded System (EOSES) is proposed as a new technological platform providing a common knowledge management approach that allows mass embedded systems for experiential knowledge capturing, storage, involving, and sharing. Knowledge in the EOSES is represented as SOEKS, and organized as Decisional DNA. The platform is mainly based on conceptual principles from Embedded Systems and Knowledge Management....
-
IEEE Transactions on Smart Grid
Journals -
Interactive Technology and Smart Education
Journals -
Smart Homecare Technology and TeleHealth
Journals -
Smart and Sustainable Manufacturing Systems
Journals -
Smart and Sustainable Built Environment
Journals -
Smart Grids and Sustainable Energy
Journals -
Grease effect on fretting wear of mild steel
PublicationNa stanowisku laboratoryjnym przeprowadzono badania zużycia frettingowego miękkiej stali smarowanej mineralnymi i syntetycznymi smarami zawierającymi także różne dodatki: grafit dwusiarczek molibdenu ZDDP i ditiocarbamat molibdenu, w różnych stężeniach.Badania wykazały istotny wpływ konsystencji smaru i jego właściwości smarnych na zużycie frettingowe miękkiej stali oraz zróżnicowany wpływ testowanych dodatków. Obecność smaru...
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Publication -
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublicationWe 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
PublicationArtykuł 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...
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublicationIn 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...
-
A Task-Scheduling Approach for Efficient Sparse Symmetric Matrix-Vector Multiplication on a GPU
PublicationIn 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....
-
Application of Shuffled Frog-Leaping Algorithm for Optimal Software Project Scheduling and Staffing
Publication -
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
PublicationThe 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...
-
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
PublicationWe 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 of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublicationWe 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.
-
Simulation Method for Scheduling Linear Construction Projects Using the Learning– Forgetting Effect
Publication -
Comparison of selected algorithms for scheduling workflow applications with dynamically changing service availability
PublicationThis 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...