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 19
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ł:
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ł:
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ł:
An exact block algorithm for no-idle RPQ problem
Autorzy:
Pempera, J.
Powiązania:
https://bibliotekanauki.pl/articles/229219.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
scheduling
single machine
no-idle
B&B algorithm
Opis:
In the work a single-machine scheduling problem is being considered, in which all tasks have a fixed availability (release) and delivery time. In the analyzed variant no-idle time is allowed on a machine. The purpose of optimization is to determine such order of tasks that minimizes the makespan, i.e. the time of execution of all the tasks. There is also a number of properties of the problem presented, in particular there are formulated block eliminating properties for no-idle constraint. There was an exact B&B algorithm based on the block properties proposed.
Źródło:
Archives of Control Sciences; 2017, 27, 2; 323-330
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A genetic algorithm-based approach for flexible job shop rescheduling problem with machine failure interference
Autorzy:
Liang, Zhongyuan
Zhong, Peisi
Zhang, Chao
Yang, Wenlei
Xiong, Wei
Yang, Shihao
Meng, Jing
Powiązania:
https://bibliotekanauki.pl/articles/27320976.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
genetic algorithm
rescheduling
machine failure
flexible job shop scheduling
Opis:
Rescheduling is the guarantee to maintain the reliable operation of production system process. In production system, the original scheduling scheme cannot be carried out when machine breaks down. It is necessary to transfer the production tasks in the failure cycle and replan the production path to ensure that the production tasks are completed on time and maintain the stability of production system. To address this issue, in this paper, we studied the event-driven rescheduling policy in dynamic environment, and established the usage rules of right-shift rescheduling and complete rescheduling based on the type of interference events. And then, we proposed the rescheduling decision method based on genetic algorithm for solving flexible job shop scheduling problem with machine fault interference. In addition, we extended the "mk" series of instances by introducing the machine fault interference information. The solution data show that the complete rescheduling method can respond effectively to the rescheduling of flexible job shop scheduling problem with machine failure interference.
Źródło:
Eksploatacja i Niezawodność; 2023, 25, 4; art. no. 171784
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new optimal algorithm for a time-dependent scheduling problem
Autorzy:
Kubale, M.
Ocetkiewicz, K. M.
Powiązania:
https://bibliotekanauki.pl/articles/969669.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
scheduling
single machine
deteriorating jobs
total completion time
algorithms
Opis:
In this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs, j1,...,jn, and the processing time pi of the i-th job is given by pi = 1 + biSi, 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 [wzór], where bmin = min{bi}, then an optimal schedule can be found in O(n log n) time. The conducted computational experiments show that the presented algorithm performs very well even on data not satisfying the assumed constraints.
Źródło:
Control and Cybernetics; 2009, 38, 3; 713-721
0324-8569
Pojawia się w:
Control and Cybernetics
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ł:
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ł:
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ł:
Artificial intelligence applications in project scheduling: a systematic review, bibliometric analysis, and prospects for future research
Autorzy:
Bahroun, Zied
Tanash, Moayad
Ad, Rami As
Alnajar, Mohamad
Powiązania:
https://bibliotekanauki.pl/articles/27315576.pdf
Data publikacji:
2023
Wydawca:
STE GROUP
Tematy:
artificial intelligence
machine learning
project scheduling
bibliometric analysis
network analysis
review
Opis:
The availability of digital infrastructures and the fast-paced development of accompanying revolutionary technologies have triggered an unprecedented reliance on Artificial intelligence (AI) techniques both in theory and practice. Within the AI domain, Machine Learning (ML) techniques stand out as essential facilitator largely enabling machines to possess human-like cognitive and decision making capabilities. This paper provides a focused review of the literature addressing applications of emerging ML toolsto solve various Project Scheduling Problems (PSPs). In particular, it employs bibliometric and network analysis tools along with a systematic literature review to analyze a pool of 104 papers published between 1985 and August 2021. The conducted analysis unveiled the top contributing authors, the most influential papers as well as the existing research tendencies and thematic research topics within this field of study. A noticeable growth in the number of relevant studies is seen recently with a steady increase as of the year 2018. Most of the studies adopted Artificial Neural Networks, Bayesian Network and Reinforcement Learning techniques to tackle PSPs under a stochastic environment, where these techniques are frequently hybridized with classical metaheuristics. The majority of works (57%) addressed basic Resource Constrained PSPs and only 15% are devoted to the project portfolio management problem. Furthermore, this study clearly indicates that the application of AI techniques to efficiently handle PSPs is still in its infancy stage bringing out the need for further research in this area. This work also identifies current research gaps and highlights a multitude of promising avenues for future research.
Źródło:
Management Systems in Production Engineering; 2023, 2 (31); 144--161
2299-0461
Pojawia się w:
Management Systems in Production Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An enhanced performance evaluation of workflow computing and scheduling using hybrid classification approach in the cloud environment
Autorzy:
Tharani, P.
Kalpana, A. M.
Powiązania:
https://bibliotekanauki.pl/articles/2086824.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
cloud
workflow scheduling
machine learning
CNN
AlexNet
chmura
planowanie przepływu pracy
nauczanie maszynowe
Opis:
Workflow scheduling is the major problem in cloud computing consists of a set of interdependent tasks which is used to solve the various scientific and healthcare issues. In this research work, the cloud based workflow scheduling between different tasks in medical imaging datasets using Machine Learning (ML) and Deep Learning (DL) methods (hybrid classification approach) is proposed for healthcare applications. The main objective of this research work is to develop a system which is used for both workflow computing and scheduling in order to minimize the makespan, execution cost and to segment the cancer region in the classified abnormal images. The workflow computing is performed using different Machine Learning classifiers and the workflow scheduling is carried out using Deep Learning algorithm. The conventional AlexNet Convolutional Neural Networks (CNN) architecture is modified and used for workflow scheduling between different tasks in order to improve the accuracy level. The AlexNet architecture is analyzed and tested on different cloud services Amazon Elastic Compute Cloud- EC2 and Amazon Lightsail with respect to Makespan (MS) and Execution Cost (EC).
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 4; e137728, 1--9
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical 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ł:
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ł:
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ł
Wyświetlanie 1-15 z 19

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