Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "machine scheduling" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 20
Tytuł:
The Unrelated Parallel Machines Scheduling Problem with Machine and Job Dependent Setup Times, Availability Constraints, Time Windows and Maintenance Times
Autorzy:
Agárdi, Anita
Nehéz, Károly
Powiązania:
https://bibliotekanauki.pl/articles/2023961.pdf
Data publikacji:
2021-09
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
production scheduling
parallel machine
setup time
time windows
genetic algorithm
Opis:
Unrelated Parallel Machines Scheduling Problem (U-PMSP) is a category of discrete optimization problems in which various manufacturing jobs are assigned to identical parallel machines at particular times. In this paper, a specific production scheduling task the U-PMSP with Machine and Job Dependent Setup Times, Availability Constraint, Time Windows and Maintenance Times is introduced. Machines with different capacity limits and maintenance times are available to perform the tasks. After that our problem, the U-PMSP with Machine and Job Dependent Setup Times, Availability Constraints, Time Windows and Maintenance Times is detailed. After that, the applied optimization algorithm and their operators are introduced. The proposed algorithm is the genetic algorithm (GA), and proposed operators are the order crossover, partially matched crossover, cycle crossover and the 2-opt as a mutation operator. Then we prove the efficiency of our algorithm with test results. We also prove the efficiency of the algorithm on our own data set and benchmark data set. The authors conclude that this GA is effective for solving high complexity parallel machine problems.
Źródło:
Management and Production Engineering Review; 2021, 13, 3; 15-24
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The optimal sequence of production orders, taking into account the cost of delays
Autorzy:
Dylewski, R.
Jardzioch, A.
Krebs, I.
Powiązania:
https://bibliotekanauki.pl/articles/407417.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
scheduling algorithms
production control
minimum cost
delays
single-machine processing
Opis:
In flexible manufacturing systems the most important element in determining the proper course of technological processes, transport and storage is the control and planning subsystem. The key planning task is to determine the optimal sequence of production orders. This paper proposes a new method of determining the optimal sequence of production orders in view of the sum of the costs related to the delayed execution of orders. It takes into account the different unit costs of delays of individual orders and the amount of allowable delays of orders involving no delay costs. The optimum sequence of orders, in the single-machine problem, in view of the sum of the costs of delays may be significantly different from the optimal order, taking into account the sum of delay times.
Źródło:
Management and Production Engineering Review; 2016, 7, 2; 21-28
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sposób szeregowania zadań dla jednej maszyny o ograniczonych zasobach
Single machine scheduling with constrains
Autorzy:
Cechowicz, R.
Powiązania:
https://bibliotekanauki.pl/articles/152841.pdf
Data publikacji:
2011
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
szeregowanie
pakowanie
zadanie niepodzielne
ograniczenia zasobów
scheduling
bin packing
genetic algorithm
single machine
resource constrains
manufacturing control
Opis:
W artykule opisano system szeregowania zadań niepodzielnych na jednej maszynie. System pozwala zoptymalizować plan produkcji poprzez ograniczenie ilości operacji transportowych i pomocniczych oraz poprzez poszukiwanie takiej kolejności realizacji zadań, dla której łączny czas wykonania będzie możliwie najmniejszy. Zastosowano zmodyfikowany algorytm genetyczny pozwalający na częściowe dostrojenie procesu do struktury danych. Testy przeprowadzone zarówno na danych dostępnych publicznie, jak i na danych pochodzących ze środowiska wytwórczego udowodniły skuteczność przyjętych rozwiązań.
A system for scheduling indivisible tasks on a single, periodically accessible machine is presented in this paper. Because of the constrains existing in the environment, the scheduling problem presented here is similar to the one-dimensional bin-packing. The tasks, stacked on a palettes (Fig.1), were transported to the machine. The palette caould be replaced by another one only after completing all the tasks assigned to it. Each task was defined by an execution time Tz and an auxiliary time Tp. The transportation time To was added to the last task from each palette and to the last task executed within the machine availability period Tm (Fig.2). A modified genetic algorithm was used for the scheduling, where the parameter K defined the number of gene changeovers (representing changing the sequence of palettes and changing the sequence of tasks within a palette) during one mutation. The results obtained for the data available in public [13] and in selected publications are presented in Tab.1. It was noted that the distribution of scheduling results (fitness=Cmax) could be modified by changing the parameter K (Figs.4 and 6). The observation was proved statistically for the data from the manufacturing system by means of the median test run for the set of 500 results, 50 for each K=1..10 (χ2=19, df=9, p=0,0254<0,05). The results of the test proved that the scheduling algorithm could be tuned for speed by adjusting the value of K. Assuming that the process was random, it could be calculated that for K=5 the expected time of getting the solution Cmax<2050, expressed in the number of generations, was the shortest (assumed confidence level 0.99). The scheduling system allowed the definition of individual machine availability periods and taking into account the restrictions of the transport system (the allowed sequences of palette retrieval).
Źródło:
Pomiary Automatyka Kontrola; 2011, R. 57, nr 9, 9; 1093-1096
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sequencing and planning of packaging lines with reliability and digital twin concept considerations - a case study of a sugar production plant
Autorzy:
Dąbrowska, Alicja
Giel, Robert
Winiarska, Klaudia
Powiązania:
https://bibliotekanauki.pl/articles/2203758.pdf
Data publikacji:
2022
Wydawca:
Wyższa Szkoła Logistyki
Tematy:
production scheduling
sugar factory
make-and-pack production
food industry
Digital Twin
machine reliability
harmonogramowanie produkcji
cukrownia
produkcja typu make-and-pack
przemysł spożywczy
niezawodność maszyn
Opis:
Background: The study focuses on simplified make-and-pack production in the sugar industry as a case study. The analyzed system is characterized by parallel packing lines, which share one resource with a sequence-independent setup time. Additionally, the special characteristics that occur in many enterprises make scheduling difficult. The special characteristics of the system are the simultaneous occurrence of a variable input stream, scheduling of processes, and including the reliability of machines. Due to the variability of the input parameters, it is appropriate to consider the use of Digital Twin, which is a virtual representation of the real processes' performance. Therefore, this purpose of the paper is two-fold. First, an analysis of sequence determination of the stream-splitting machine was performed with taking into account the impact of logistics system reliability on system performance. Second, the concept of implementing Digital Twin in the analyzed production process is presented. Methods: The mathematical model for line efficiency was developed on the presented make-and-pack production presented in the selected sugar industry. Different sequences of stream-splitting machines were studied to examine the system's efficiency, availability, and utilization of packaging lines. Two scenarios were investigated with the use of computer simulation. Results: Computer simulation experiments were performed to investigate the sequencing and planning of packaging line problems. The results obtained for the case company indicated a significant dependence between the preferred packing sequence and the operational parameters. Conclusions: The simulations confirm the influence of internal and external factors on sugar line packaging processes. The main advantage of the developed simulation model is identifying the relationship between the size of the input stream and the system's availability level, as well as identifying the main constraints on the possibility of implementing the DT concept in the analyzed company.
Źródło:
LogForum; 2022, 18, 3; 321--334
1734-459X
Pojawia się w:
LogForum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
Autorzy:
Różycki, R.
Waligóra, G.
Węglarz, J.
Powiązania:
https://bibliotekanauki.pl/articles/330888.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
machine scheduling
preemptable jobs
continuous resource
makespan
mathematical programming
szeregowanie zadań
zasób ciągły
programowanie matematyczne
Opis:
In this work we consider a problem of scheduling preemptable, independent jobs, characterized by the fact that their processing speeds depend on the amounts of a continuous, renewable resource allocated to jobs at a time. Jobs are scheduled on parallel, identical machines, with the criterion of minimization of the schedule length. Since two categories of resources occur in the problem: discrete (set of machines) and continuous, it is generally called a discrete-continuous scheduling problem. The model studied in this paper allows the total available amount of the continuous resource to vary over time, which is a practically important generalization that has not been considered yet for discrete-continuous scheduling problems. For this model we give some properties of optimal schedules on a basis of which we propose a general methodology for solving the considered class of problems. The methodology uses a two-phase approach in which, firstly, an assignment of machines to jobs is defined and, secondly, for this assignment an optimal continuous resource allocation is found by solving an appropriate mathematical programming problem. In the approach various cases are considered, following from assumptions made on the form of the processing speed functions of jobs. For each case an iterative algorithm is designed, leading to an optimal solution in a finite number of steps.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 693-706
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
Autorzy:
Furmańczyk, H.
Kubale, M.
Powiązania:
https://bibliotekanauki.pl/articles/200295.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
equitable coloring
NP-hardness
polynomial algorithm
scheduling
uniform machine
kolorowanie grafów
twardość NP
algorytm wielomianowy
planowanie
Opis:
In the paper we consider the problem of scheduling n identical jobs on 4 uniform machines with speeds s1 ≥ s2 ≥ s3 ≥ s4, respectively. Our aim is to find a schedule with a minimum possible length. We assume that jobs are subject to some kind of mutual exclusion constraints modeled by a bipartite incompatibility graph of degree Δ, where two incompatible jobs cannot be processed on the same machine. We show that the general problem is NP-hard even if s1 = s2 = s3. If, however, Δ ≤ 4 and s1 ≥ 12s2, s2 = s3 = s4, then the problem can be solved to optimality in time O(n1.5). The same algorithm returns a solution of value at most 2 times optimal provided that s1 ≥ 2s2. Finally, we study the case s1 ≥ s2 ≥ s3 = s4 and give a 32/15-approximation algorithm running also in O(n1.5) time.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 1; 29-34
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Research on optimization of unrelated parallel machine scheduling based on IG-TS algorithm
Autorzy:
Chi, Xinfu
Liu, Shijing
Li, Ce
Powiązania:
https://bibliotekanauki.pl/articles/2173693.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
warp knitting machine
parallel machine scheduling
iterative greedy algorithm
tabu search
osnowarka
planowanie maszyn równoległych
algorytm zachłanny iteracyjny
przeszukiwanie tabu
Opis:
This issue is a typical NP-hard problem for an unrelated parallel machine scheduling problem with makespan minimization as the goal and no sequence-related preparation time. Based on the idea of tabu search (TS), this paper improves the iterative greedy algorithm (IG) and proposes an IG-TS algorithm with deconstruction, reconstruction, and neighborhood search operations as the main optimization process. This algorithm has the characteristics of the strong capability of global search and fast speed of convergence. The warp knitting workshop scheduling problem in the textile industry, which has the complex characteristics of a large scale, nonlinearity, uncertainty, and strong coupling, is a typical unrelated parallel machine scheduling problem. The IG-TS algorithm is applied to solve it, and three commonly used scheduling algorithms are set as a comparison, namely the GA-TS algorithm, ABC-TS algorithm, and PSO-TS algorithm. The outcome shows that the scheduling results of the IG-TS algorithm have the shortest manufacturing time and good robustness. In addition, the production comparison between the IG-TS algorithm scheduling scheme and the artificial experience scheduling scheme for the small-scale example problem shows that the IG-TS algorithm scheduling is slightly superior to the artificial experience scheduling in both planning and actual production. Experiments show that the IG-TS algorithm is feasible in warp knitting workshop scheduling problems, effectively realizing the reduction of energy and the increase in efficiency of a digital workshop in the textile industry.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 4; art. no. e141724
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Random forest based power sustainability and cost optimization in smart grid
Autorzy:
Durairaj, Danalakshmi
Wróblewski, Łukasz
Sheela, A.
Hariharasudan, A.
Urbański, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/23966623.pdf
Data publikacji:
2022
Wydawca:
Stowarzyszenie Menedżerów Jakości i Produkcji
Tematy:
smart grid
las losowy
internet rzeczy
zarządzanie energią
uczenie maszynowe
licznik inteligentny
random forest
Internet of things
power management
machine learning
smart meter
priority power scheduling
Opis:
Presently power control and management play a vigorous role in information technology and power management. Instead of non-renewable power manufacturing, renewable power manufacturing is preferred by every organization for controlling resource consumption, price reduction and efficient power management. Smart grid efficiently satisfies these requirements with the integration of machine learning algorithms. Machine learning algorithms are used in a smart grid for power requirement prediction, power distribution, failure identification etc. The proposed Random Forest-based smart grid system classifies the power grid into different zones like high and low power utilization. The power zones are divided into number of sub-zones and map to random forest branches. The sub-zone and branch mapping process used to identify the quantity of power utilized and the non-utilized in a zone. The non-utilized power quantity and location of power availabilities are identified and distributed the required quantity of power to the requester in a minimal response time and price. The priority power scheduling algorithm collect request from consumer and send the request to producer based on priority. The producer analysed the requester existing power utilization quantity and availability of power for scheduling the power distribution to the requester based on priority. The proposed Random Forest based sustainability and price optimization technique in smart grid experimental results are compared to existing machine learning techniques like SVM, KNN and NB. The proposed random forest-based identification technique identifies the exact location of the power availability, which takes minimal processing time and quick responses to the requestor. Additionally, the smart meter based smart grid technique identifies the faults in short time duration than the conventional energy management technique is also proven in the experimental results.
Źródło:
Production Engineering Archives; 2022, 28, 1; 82--92
2353-5156
2353-7779
Pojawia się w:
Production Engineering Archives
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimization of delay costs in the realization of production orders in two-machine system
Autorzy:
Dylewski, R.
Jardzioch, A.
Dworak, O.
Powiązania:
https://bibliotekanauki.pl/articles/410059.pdf
Data publikacji:
2018
Wydawca:
STE GROUP
Tematy:
flexible manufacturing system
scheduling of orders
minimal costs of delays
two-machine flow system
Opis:
The article presents a new algorithm that enables the allocation of the optimal scheduling of the production orders in the two-machine system based on the minimum cost of order delays. The formulated algorithm uses the method of branch and bounds and it is a particular generalisation of the algorithm enabling for the determination of the sequence of the production orders with the minimal sum of the delays. In order to illustrate the proposed algorithm in the best way, the article contains examples accompanied by the graphical trees of solutions. The research analysing the utility of the said algorithm was conducted. The achieved results proved the usefulness of the proposed algorithm when applied to scheduling of orders. The formulated algorithm was implemented in the Matlab programme. In addition, the studies for different sets of production orders were conducted.
Źródło:
Management Systems in Production Engineering; 2018, 1 (26); 14-22
2299-0461
Pojawia się w:
Management Systems in Production Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Machine learning for supporting irrigation decisions based on climatic water balance
Autorzy:
Treder, Waldemar
Klamkowski, Krzysztof
Wójcik, Katarzyna
Tryngiel-Gać, Anna
Powiązania:
https://bibliotekanauki.pl/articles/27312625.pdf
Data publikacji:
2023
Wydawca:
Instytut Technologiczno-Przyrodniczy
Tematy:
apple tree
evapotranspiration
irrigation scheduling
machine learning
precipitation
WEKA software
Opis:
A machine learning model was developed to support irrigation decisions. The field research was conducted on ‘Gala’ apple trees. For each week during the growing seasons (2009-2013), the following parameters were determined: precipitation, evapotranspiration (Penman-Monteith formula), crop (apple) evapotranspiration, climatic water balance, crop (apple) water balance (AWB), cumulative climatic water balance (determined weekly, ∑CWB), cumulative apple water balance (∑AWB), week number from full bloom, and nominal classification variable: irrigation, no irrigation. Statistical analyses were performed with the use of the WEKA 3.9 application software. The attribute evaluator was performed using Correlation Attribute Eval with the Ranker Search Method. Due to its highest accuracy, the final analyses were performed using the WEKA classifier package with the J48graft algorithm. For each of the analysed growing seasons, different correlations were found between the water balance determined for apple trees and the actual water balance of the soil layer (10-30 cm). The model made correct decisions in 76.7% of the instances when watering was needed and in 87.7% of the instances when watering was not needed. The root of the classification tree was the AWB determined for individual weeks of the growing season. The high places in the tree hierarchy were occupied by the nodes defining the elapsed time of the growing season, the values of ∑CWB and ∑AWB.
Źródło:
Journal of Water and Land Development; 2023, 58; 25--30
1429-7426
2083-4535
Pojawia się w:
Journal of Water and Land Development
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Exact approaches to late work scheduling on unrelated machines
Autorzy:
Liu, Xinbo
Wang, Wen
Chen, Xin
Sterna, Malgorzata
Blazewicz, Jacek
Powiązania:
https://bibliotekanauki.pl/articles/11542692.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
late work scheduling
unrelated machine
mathematical model
branch algorithm
bound algorithm
dynamic programming
planowanie pracy
model matematyczny
algorytm podziału
algorytm ograniczeń
programowanie dynamiczne
Opis:
We consider the scheduling problem on unrelated parallel machines in order to minimize the total late work. Since the problem is NP-hard, we propose a mathematical model and two dedicated exact approaches for solving it, based on the branching and bounding strategy and on enumerating combined with a dynamic programming algorithm. The time efficiencies of all three approaches are evaluated through computational experiments.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2023, 33, 2; 285--295
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Determining the minimum sum of production order delays in a two-machine system
Autorzy:
Jardzioch, A.
Dylewski, R.
Powiązania:
https://bibliotekanauki.pl/articles/406828.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
two-machine flow system
job scheduling
minimum delay times
Opis:
One of the main tasks in the planning of production processes is to satisfy the needs of the customers in terms of quantity, quality and time. The issue of the timely execution of production orders is becoming increasingly important. Based on the conducted studies it can be concluded that the size of the delay depends on the adopted scheduling of orders. This paper focuses on the problem of implementing a scheduling of production orders that will allow to avoid delays, and in the event such a scheduling is not possible, for minimizing the sum of delays of all the orders. A new algorithm has been proposed that allows to determine of the optimal sequence of production orders with the minimum sum of delays. The considerations have been limited to the issue of a two-machine system in which the orders are carried out in a flow.
Źródło:
Management and Production Engineering Review; 2017, 8, 3; 31-39
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cyclic flow shop scheduling problem with two-machine cells
Autorzy:
Bożejko, W.
Gnatowski, A.
Idzikowski, R.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/229393.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
job shop
cyclic scheduling
multi-machine
assignment
Opis:
In the paper a variant of cyclic production with setups and two-machine cell is considered. One of the stages of the problem solving consists of assigning each operation to the machine on which it will be carried out. The total number of such assignments is exponential. We propose a polynomial time algorithm finding the optimal operations to machines assignment.
Źródło:
Archives of Control Sciences; 2017, 27, 2; 151-167
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Collaborative paradigm for single-machine scheduling under just-in-time principles: total holding-tardiness cost problem
Autorzy:
Varela, M. L. R.
Madureira, A. M.
Dantas, J. D.
Santos, A. S.
Putnik, G. D.
Trojanowska, J.
Machado, J.
Powiązania:
https://bibliotekanauki.pl/articles/406794.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
single-machine
scheduling
heuristics
just-in-time
agile manufacturing
holding-tardiness cost problem
Opis:
The problem of sequencing jobs on a single machine to minimize total cost (earliness and tardiness) is nowadays not just important due to traditional concerns but also due to its importance in the context of Collaborative Networked Organizations and Virtual Enterprises, where precision about promptly responses to customers’ requests, along with other important requirements, assume a crucial role. In order to provide a contribution in this direction, in this paper the authors contribute with an applied constructive heuristics that tries to find appropriate solutions for single machine scheduling problems under different processing times and due dates, and without preemption allowed. In this paper, two different approaches for single-machine scheduling problems, based on external and internal performance measures are applied to the problem and a comparative analysis is performed. Computational results are presented for the problem under Just-in-Time and agile conditions on which each job has a due date, and the objective is to minimize the sum of holding costs for jobs completed before their due date and tardiness costs for jobs completed after their due date. Additional computational tests were developed based on different customer and enterprise oriented performance criteria, although preference is given to customer-oriented measures, namely the total number of tardy jobs and the maximum tardiness.
Źródło:
Management and Production Engineering Review; 2018, 9, 1; 90-103
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Better polynomial algorithms for scheduling unit-length jobswith bipartite incompatibility graphs on uniform machines
Autorzy:
Pikies, T.
Kubale, Marek
Powiązania:
https://bibliotekanauki.pl/articles/201958.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
approximation algorithm
graph coloring
incompatible job
polynomial algorithm
scheduling
uniform machine
unit-time jobs
algorytm aproksymacyjny
kolorowanie grafów
algorytm wielomianowy
planowanie
praca jednostkowa
Opis:
The goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|pj = 1, G = bisubquartic|Cmax. The second one is Algorithm 3 which is 4-approximate for the problem Qm|pj = 1, G = bisubquartic|ΣCj, where m ϵ {2, 3, 4}. The theory behind the proposed algorithms is based on the properties of 2-coloring with maximal coloring width, and on the properties of ideal machine, an abstract machine that we introduce in this paper.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2019, 67, 1; 31-36
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 20

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies