Search
Filters
total: 1288
filtered: 878
-
Catalog
- Publications 878 available results
- Journals 189 available results
- Conferences 10 available results
- Publishing Houses 2 available results
- People 50 available results
- Projects 3 available results
- e-Learning Courses 27 available results
- Events 29 available results
- Open Research Data 100 available results
Chosen catalog filters
Search results for: OPEN SHOP SCHEDULING
-
Restricted open shop scheduling
PublicationIn 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)....
-
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.
-
Chromatic scheduling in a cyclic open shop
PublicationPraca 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.
-
Compact Scheduling In Open Shop With Zero-One Time Operations
Publication -
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...
-
Cost approach to the flow-shop construction scheduling
Publication -
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,...
-
NP-hardness of compact scheduling in simplified open and flow shops
Publication -
Open shop problem with zero-one time operations and integer release date/deadline intervals
Publication -
Shared processor scheduling
PublicationWe 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...
-
Programowanie dynamiczne w rozwiązywaniu problemów szeregowania zadań w systemach o acyklicznej strukturze
PublicationRozważono rozrzedzone systemy niepodzielnych zadań dwuprocesorowych o jednostkowych długościach operacji oraz systemy maszyn dedykowanych (open shop,flow shop, mixed shop) o operacjach zero-jedynkowych. Przedstawiono rodzinę wielomianowych algorytmów opartych na programowaniu dynamicznym, pozwalających na znalezienie optymalnego uszeregowania względem szerokiej rodziny funkcji kryterialnych. Stopień rozrzedzenia systemu zdefiniowano...
-
Shared processor scheduling of multiprocessor jobs
PublicationWe 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...
-
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...
-
Two Time-Scale Hierarchical Control of Integrated Quantity and Quality in Drinking Water Distribution Systems
PublicationThe 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...
-
Szeregowanie zadań dwuprocesorowych w systemach otwartych
PublicationW pracy rozważany jest problem szeregowania zadań dwuoperacyjnych w systemie otwartym (open-shop), z kryterium minimalizacji długości harmonogramu oraz sumy czasów zakończenia wszystkich zadań. Zakładając jednostkowe czasy wykonywania operacji można stosować efektywne metody chromatyczne rozwiązywania problemu, poprzez sprowadzenie go do modelu grafowego oraz zastosowanie w nim wybranego modelu kolorowania, które pozwala uzyskać...
-
Energy-Aware High-Performance Computing: Survey of State-of-the-Art Tools, Techniques, and Environments
PublicationThe 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...
-
Network-aware Data Prefetching Optimization of Computations in a Heterogeneous HPC Framework
PublicationRapid 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...
-
Yade-open DEM: an open-source software using a discrete element methodto simulate granular material
PublicationPurpose - YADE-OPEN DEM is an open source software based on the Discrete Element Method which uses object oriented programming techniques. The paper describes the softwarearchitecture.Design/methodology/approach - The DEM chosen uses position, orientation, velocity and angular velocity as independent variables of simulated particles which are subject to explicit leapfrog time-integration scheme (Lagrangian method). The three-dimensional...
-
KernelHive: a new workflow-based framework for multilevel high performance computing using clusters and workstations with CPUs and GPUs
PublicationThe 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....
-
SMART SHOP SERVICES FOR BUILDING CUSTOMER-ORIENTED SCENARIOS
PublicationThe shops of today mostly support the customer by offering him or her products based on basic relationships between products viewed or ordered by users with similar tastes. This common approach may fail in many cases especially when the user does not have sufficient knowledge about the market, or when he or she wants to build a set of products in more than one shop. New categories of smart shop services are proposed in order to...
-
Shared multi-processor scheduling
PublicationWe 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...
-
development of an open source software to transform acoustic data for classification of benthic habitat
Publication.
-
Scheduling of compatible jobs on parallel machines
PublicationThe 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...
-
On-Line Partitioning for On-Line Scheduling with Resource Conflicts
PublicationWithin 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...
-
Dedicated scheduling of tasks to minimize mean flow time
PublicationThis 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.
-
Open Access w naukach biomedycznych
PublicationOpen Access (OA) Movement to nazwa ruchu społecznego, którego celem jest zminimalizowanie przeszkód w upowszechnianiu wyników badań naukowych, a także bardziej efektywne wykorzystywanie nakładów na naukę. Jego historia sięga lat sześćdziesiątych XX wieku, kiedy pojawiły się pierwsze formy sieci rozległych, ale zasadniczy rozwój nastąpił w latach dziewięćdziesiątych wraz z nadejściem tzw. ery cyfrowej. Pojawiła się wówczas koncepcja...
-
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
PublicationThis 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
Publicationthis 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
PublicationThe 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...
-
Making full and immediate Open Access a reality through the repository route – the role of open repositories in implementation of Plan S.
PublicationThesis/Objective: In 2018, research funding institutions associated in cOAlitionS issued PlanS document which aims to accelerate the transition to full and immediate Open Access to publications from publicly funded research until January 2021. Among the recommendations, which mainly relate to publishing in the Open Access model and its financing, there are also guidelines on the implementation of Plan S assumptions through the...
-
Task Scheduling – Review of Algorithms and Analysis of Potential Use in a Biological Wastewater Treatment Plant
PublicationThe 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...
-
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,...
-
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...
-
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...
-
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...
-
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:...
-
A new optimal algorithm for a time-dependent scheduling problem
PublicationIn 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...
-
Heuristic scheduling algorithms for uniform load of computer system
PublicationW 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...
-
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,...
-
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....
-
The Bridge to Knowledge – Open Access to Scientific Research Results on Multidisciplinary Open System Transferring Knowledge Platform
PublicationThe European policy of Open Access to scientific research is now one of the key issues discussed in public debates on the future development of scientific communication. The implementation of Open Access tools has significant impact on scientific and economic growth. On the one hand, Open Access accelerates disseminating new research findings and facilitates recognition of authors on a more global scale. On the other hand, Open...
-
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...
-
What Skills for Multi-Partner Open Innovation Projects? Open Innovation Competence Profile in a Cluster Ecosystem Context
PublicationIndustry 4.0 and the turbulent environment have rendered increasing interest in open inno- vation that extends from the bilateral transmission of expertise to multilateral platform collaborations. Open innovation ventures are seen as intricate collaborations that require the commitment of numer- ous partners during the lifetime of the project. In order to examine the specific competence of open innovation teams, we set the research...
-
Trouble in Paradise? Barriers to Open Innovation in Regional Clusters in the Era of the 4th Industrial Revolution
PublicationThe purpose of this paper is to provide an insight into the barriers faced by clusters as open innovation intermediaries. Literature review and an empirical study were performed, involving a nation-wide survey, case studies, and in-depth interviews with cluster actors involved in open innovation activities. This article conceptually links open innovation and clusters in the context of the fourth industrial revolution, empirically...
-
Seminarium Baltazar Open Days
PublicationArtykuł syntetycznie przedstawia zagadnienia poruszone podczas seminarium dotyczącego konstrukcji kompozytowych Baltazar Open Days 2016, które odbyło się w dniach 6-8.12.2016 w Ostródzie.
-
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...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
PublicationIn 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...
-
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...
-
Adopting collaborative games into Open Kanban
PublicationThe crucial element of any agile project is people. Not surprisingly, principles and values such as "Respect for people", "Communication and Collaboration", "Lead using a team approach", and "Learn and improve continuously" are an integral part of Open Kanban. However, Open Kanban has not provided any tools or techniques to aid the human side of software development. Moreover, as a Lean initiative, it is not as comprehensively...
-
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.