Search
Filters
total: 701
-
Catalog
Search results for: batch scheduling
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Publication -
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...
-
JOURNAL OF SCHEDULING
Journals -
BatchI: Batch effect Identification in high-throughput screening data using a dynamic programming algorithm
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...
-
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)....
-
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...
-
Parallel scheduling by graph ranking
PublicationNr 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...
-
Media Watch
Journals -
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...
-
Genetic ANFIS for scheduling in telecommunication networks
Publication -
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...
-
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.
-
Concept of a swirling diffuser in batch blending tanks
PublicationThe mixing of two or more components belongs to the category of the most common unit operations, both in technology and in nature. One particular version is homogenization (blending), the effectivity of which is strongly related to the blending time. Among many differentiated individual solutions of mixing systems used in blenders, one should distinguish the class of agitators with diffusers. An analysis of the character of the...
-
Issues of Measuring the Course of Batch Production Processes
PublicationIn order to meet demands induced by development of manufacturing processes and production systems, new criteria and indicators that would allow a multiple aspect and realistic rating of batch production process courses are necessary. The objective of this paper is to present the correlation between production processes measurement, its rating and production control, basing on case study analysis from production enterprise. A new...
-
Catch an innovation
PublicationEnforcement of innovation is often seen as something imperceptible, something that one can't learn. This article is trying to approve that organizations can learn how to deploy innovations.The knowledge can be saved in such matter that it will be possible to reuse it later.
-
Catch an innovation
PublicationZaproponowano podejście do wykorzystania wiedzy zawartej w procesach innowacyjnych. Przedstawiono model pomocny w wychwytywaniu tego rodzaju wiedzy.
-
Bach: The Journal of the Riemenschneider Bach Institute
Journals -
Bach-Jahrbuch
Journals -
Artificial Neural Network for Multiprocessor Tasks Scheduling
Publication -
Cost approach to the flow-shop construction scheduling
Publication -
Web Based Application for Probability Job Scheduling
Publication -
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...
-
Evaluation of Batch Production Processes Based on Seven Criterions
PublicationTo answer growing demand on products adapted to clients’ individual needs, it is required to develop new ways of measurement and rating for batch production processes. The researchers developed method which allows synthetic and complex evaluation, as well as improvement of these processes. Case study with participating observation, non-participating observation, interviews, and the analysis of historical data was conducted in order...
-
Removal of Pharmaceutically Active Compounds in Sequencing Batch Reactor
PublicationIn recent years, considerable attention was paid to the presence of organic micro-pollutants such as Active Pharmaceutical Ingredients (API) in the aquatic environment due to their negative impact on public health and aquatic ecosystems. Numerous papers have pointed out API presence as common constituents of effluents from Wastewater Treatment Plants (WWTPs). This is the result of various efficiencies of API removal by conventional...
-
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 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...
-
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...
-
An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
Publication -
Fuzzy Scheduling Problem of Vessels in One-Way Waterway
Publication -
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 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...
-
Elimination of dominated partial schedules in scheduling deteriorating jobs
Publicationw 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...
-
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...
-
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.
-
Scheduling algorithms for multimedia services in hiperlan/2 networks
PublicationW 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.
-
Econ Journal Watch
Journals -
A study on the use of the BioBall® as a biofilm carrier in a sequencing batch reactor
Publication -
The mycobiota of landfill leachates in the pretreatment process in a sequencing batch reactor
Publication -
Modelling of sequencing batch reactor operating at various aeration modes
PublicationThe presented study involved designing a computer model of a sequencing batch reactor (SBR) at laboratory scale. The data pertaining to the technical aspects of the bioreactor and quality indicators of wastewater constituted the input for the employed simulation tool, i.e. GPS-X software package. The results of a simulation involving a 12-hour operation cycle are presented in this work; each cycle included 6 phases: filling, mixing,...
-
Bioaugmentation of a sequencing batch reactor with Archaea for the treatment of reject water
PublicationIn this study, the bioaugmentation of a sequencing batch reactor (SBR) for the treatment of reject water from wastewater treatment plant was evaluated. For the bioaugmentation step a product containing an enrichment of microorganisms from the Archaea domain was used to enhance the performance of the reactor for treating reject water. The experiment was carried out in two parallel lab-scale sequencing batch reactors. The first one...
-
The Influence of Sulfate on Anaerobic Ammonium Oxidation in a Sequencing Batch Reactor
PublicationAnaerobic ammonia-oxidizing bacteria have a more comprehensive metabolism than expected - there may be other electron acceptors that oxidize ammonium nitrogen under anaerobic conditions, in addition to the well-known nitrite nitrogen, one of which is sulfate in the sulfammox process. Sulfate-containing compounds are part of the medium for the anammox process, but their concentrations are not particularly high (0.2 g MgSO4 ∙ 7H2O/dm3...
-
Biophilic Design: A Trend Watch
PublicationDuring the 20th century, many people migrated to cities for employment and economic opportunities, abandoning farming and natural landscapes so their direct connection to the countryside and nature was lost. This process continues to this day with unprecedented urban growth, in fact, it’s estimated 68% of the world population will live in urban areas by 2050. Due to the evolutionary disposition of humans, when people live in an...
-
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 -
Scheduling Repetitive Construction Processes Using the Learning-Forgetting Theory
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...