PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 8

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  scheduling algorithms
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available The optimal sequence of production orders, taking into account the cost of delays
Dylewski R., Jardzioch A., Krebs I.
Management and Production Engineering Review
|
2016
|
Vol. 7, No. 2
21--28
EN
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.
2
Content available Zastosowanie algorytmów szeregowania zadań do planowania pracy specjalistów
Milewska E.
Systemy Wspomagania w Inżynierii Produkcji
|
2015
|
z. 2 (11)
136--148
PL
W artykule przedstawiono etapy budowy systemu informatycznego wspomagającego zarządzanie pracą specjalistów, umożliwiając zautomatyzowanie procesu decyzyjnego dyspozytora. Autor opracował elementy modelu matematycznego i zdefiniował kryteria optymalizacji harmonogramowania pracy wykwalifikowanych pracowników. Przedstawił również prototyp implementacji systemu.
EN
This paper presents the stages of building management system supporting the work of specialists, allowing to automate the decision-making process dispatcher. The author developed a mathematical model elements and scheduling optimization criteria defined skilled labor. She also presented a prototype system implementation.
3
Content available Scheduling production orders, taking into account delays and waste
Dylewski R., Jardzioch A.
Management and Production Engineering Review
|
2014
|
Vol. 5, No. 3
3--8
EN
The article addresses the problem of determining the sequence of entering orders for production in a flexible manufacturing system implementing technological operations of cutting sheet metal. Adopting a specific ranking of production orders gives rise to the vector of delays and waste in the form of incompletely used sheets. A new method was postulated for determining the optimal sequence of orders in terms of two criteria: the total cost of delays and the amount of production waste. The examples illustrate the advantages of the proposed method compared with the popular heuristic principles.
4
Content available Routing flow-shop with buffers and ready times - comparison of selected solution algorithms
Józefczyk J., Markowski M., Balgabaeva L.
Management and Production Engineering Review
|
2014
|
Vol. 5, No. 4
26--35
EN
This article extends the former results concerning the routing flow-shop problem to minimize the makespan on the case with buffers, non-zero ready times and different speeds of machines. The corresponding combinatorial optimization problem is formulated. The exact as well as four heuristic solution algorithms are presented. The branch and bound approach is applied for the former one. The heuristic algorithms employ known constructive idea proposed for the former version of the problem as well as the Tabu Search metaheuristics. Moreover, the improvement procedure is proposed to enhance the quality of both heuristic algorithms. The conducted simulation experiments allow evaluating all algorithms. Firstly, the heuristic algorithms are compared with the exact one for small instances of the problem in terms of the criterion and execution times. Then, for larger instances, the heuristic algorithms are mutually compared. The case study regarding the maintenance of software products, given in the final part of the paper, illustrates the possibility to apply the results for real-world manufacturing systems.
5
Content available Custom scheduling algorithms in real-world applications
Bożek A.
Research in Logistics & Production
|
2012
|
Vol. 2, No. 3
233-245
EN
The paper describes the possibility of using of the Preactor Express software as a visualisation and manipulation platform for custom scheduling algorithms. The implementation of a custom scheduling algorithm for a real-world application is often far less time consuming than developing a practical and comfortable user interface for the application. It is the reason why many of scheduling algorithms remain only academic ideas. Preactor Express provides many ways of accessing scheduling data, e.g.: an interactive Gantt chart, resource calendars, a report generator. Preactor Express is free of charge software. Rules of connecting external algorithms to the Preactor Express are presented and a simple example of the connection with a custom algorithm is given in the paper. The purpose of the solution is to provide a bridge between custom innovative scheduling algorithms and a professional graphical user interface characteristic of real-world applications. It can be valuable for prototype projects for industry as well as for researchers that develop scheduling algorithms.
6
Content available remote Scheduling algorithm for delay and jitter reduction of periodic tasks in real-time systems
Martyna J.
Przegląd Elektrotechniczny
|
2011
|
R. 87, nr 1
236-239
EN
Real-time systems, especially software control systems, are developed to meet the requirements of real-time automation systems. One such crucial requirement is reducing the delay and jitter of periodic tasks in such systems. In this paper, we present a new method for reducing delays and jitters of periodic tasks, which are enforced by the operating system, control tasks, kernel mechanisms, etc. Our algorithm is evaluated and compared with other scheduling algorithms in terms of jitter. The effectiveness of our algorithm is confirmed by the experimental results.
PL
W pracy przedstawiono algorytm szeregowania dla redukcji fluktuacji i opóźnień zadań okresowych w systemach czasu rzeczywistego. Zastosowanie takiego algorytmu gwarantuje przewidywalność oraz poprawia efektywność działania systemów. Dodatkowo dzięki niemu jest możliwe zmniejszenie fluktuacji czasu odpowiedzi zadań okresowych. Możliwości działania prezentowanego algorytmu zostały potwierdzone w badaniach symulacyjnych.
7
Content available remote Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs
Janiak A., Janiak W.A., Januszkiewicz R.
Bulletin of the Polish Academy of Sciences. Technical Sciences
|
2009
|
Vol. 57, nr 3
209-215
EN
We have studied problems of scheduling n unit-time jobs on m identical parallel processors, in which for each job a distinct due window is given in advance. If a job is completed within its due window, then it incurs no penalty. Otherwise, it incurs a job-dependent earliness or tardiness cost. The objective is to find a job schedule such that the total weighted earliness and tardiness, maximum weighted earliness and tardiness or total weighted number of early and lardy jobs is minimized. Properties of optimal solutions of these problems are established. We proved that optimal solutions for these problems can be found in O(n5) time in case of minimization of the total weighted earliness and tardiness and the total weighted number of early and tardy jobs and in O (n4 n log n) time in case of minimization of the maximum weighted earliness and tardiness. The established solution methods are extended to solve the problems with arbitrary integer release dates. A dedicated algorithm with time complexity O(n3) is provided for the special case of the problem of minimizing total weighted number of early and tardy jobs with agreeable earliness-tardiness weights.
8
Content available remote Algorytmy szeregowania zadań wielowariantowych na procesorach równoległych
Ciecholewski M.
Elektrotechnika i Elektronika
|
2004
|
T. 23, z. 2
98-104
PL
W artykule przedstawiono algorytm szeregowania zadań wielowariantowych na procesorach równoległych (o nazwie szereguj_2). Wchodzi on w skład programu komputerowego zaprezentowanego w pracy [3]. W pracy szczegółowo omówiono operacje zastosowane w algorytmie, umożliwiające przydzielanie zadań wielowariantowych do procesorów w jak najwcześniejszym terminie, a także pozwalające eliminować sytuacje konfliktowe, czyli przydzielanie zadań w danym czasie do tych samych procesorów.
EN
This paper presents an algorithm for scheduling of the multi-variant tasks problem on parallel processors (defined as szereguj_2). The algorithm is included in the computer program which has been presented in [3]. The paper fully details implemented operations, applicable to allocate multi-variant tasks to processors under the hard-time constraints. It also covers a solution how to avoid conflicts between resources.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.