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ę "scheduling heuristics" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-11 z 11
    Tytuł:
    A hybrid scheduler for many task computing in big data systems
    Autorzy:
    Vasiliu, L.
    Pop, F.
    Negru, C.
    Mocanu, M.
    Cristea, V.
    Kolodziej, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/907647.pdf
    Data publikacji:
    2017
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    many task computing
    scheduling heuristics
    QoS
    big data system
    simulation
    obliczenia wielofunkcyjne
    szeregowanie zadań
    duży zbiór danych
    Opis:
    With the rapid evolution of the distributed computing world in the last few years, the amount of data created and processed has fast increased to petabytes or even exabytes scale. Such huge data sets need data-intensive computing applications and impose performance requirements to the infrastructures that support them, such as high scalability, storage, fault tolerance but also efficient scheduling algorithms. This paper focuses on providing a hybrid scheduling algorithm for many task computing that addresses big data environments with few penalties, taking into consideration the deadlines and satisfying a data dependent task model. The hybrid solution consists of several heuristics and algorithms (min-min, min-max and earliest deadline first) combined in order to provide a scheduling algorithm that matches our problem. The experimental results are conducted by simulation and prove that the proposed hybrid algorithm behaves very well in terms of meeting deadlines.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2017, 27, 2; 385-399
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Heuristic algorithms for preemptive scheduling in a Two-stage flowshop with unrelated parallel machines and 0-1 resource requirements
    Autorzy:
    Figielska, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/969665.pdf
    Data publikacji:
    2009
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    preemptive scheduling
    flowshop
    parallel unrelated machines
    resource constraints
    heuristics
    Opis:
    The paper considers the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines at the first stage and a single machine at the second stage. At the first stage, jobs use some additional renewable resources which are available in limited quantities. The resource requirements are of 0-1 type. The objective is minimization of the makespan. The problem is NP-hard. We develop heuristic algorithms which first solve the problem occurring at stage 1, and then find a final schedule in the flowshop. An extensive computational experiment shows that the proposed heuristic algorithms can be an efficient tool capable of finding good quality solutions.
    Źródło:
    Control and Cybernetics; 2009, 38, 3; 723-743
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Two-Phase Algorithm for a Resource Constrained Project Scheduling Problem with Discounted Cash Flows
    Autorzy:
    Klimek, M.
    Łebkowski, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/375952.pdf
    Data publikacji:
    2013
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    resource-constrained project scheduling
    discounted cash flows
    milestones
    heuristics
    Opis:
    This paper presents a Resource-Constrained Project Scheduling Problem (RCPSP) settled by contractual milestones. The criterion analysed here is the maximisation of aggregate discounted cash flows from the contractor´s perspective, known as an RCPSP problem with Discounted Cash Flows (RCPSPDCF). The cash flows analysed here cover the contractor´s cash outflows (negative cash flows), related to the commencement of individual activities, and cash inflows (positive cash flows) after the fulfilment of individual milestones. The authors propose a two-phase algorithm for solving the problem defined. In the first phase, the simulated annealing metaheuristics is used, designed to identify a forward schedule with as high total DCF as possible. In the second phase, the best first-phase schedule is improved by right shifts of activities. To this end, the procedure which iteratively shifts tasks by one unit is applied, with a view to maximising the objective function. Activity shifts take into consideration precedence and resource constraints, and they are performed for a specified resource allocation to activities. This paper also includes an analysis of the problem for a sample project. The results of computational experiments are then analysed. The experiments were run with the use of standard test problems from the Project Scheduling Problem LIBrary (PSPLIB), with additionally defined cash flows and contractual milestones.
    Źródło:
    Decision Making in Manufacturing and Services; 2013, 7, 1-2; 51-68
    1896-8325
    2300-7087
    Pojawia się w:
    Decision Making in Manufacturing and Services
    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ł:
    Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids
    Autorzy:
    Kołodziej, J.
    Xhafa, F.
    Powiązania:
    https://bibliotekanauki.pl/articles/907798.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    przetwarzanie siatkowe
    szeregowanie
    bezpieczeństwo
    computational grids
    scheduling
    non-cooperative games
    user behavior
    security
    meta-heuristics
    Opis:
    Tasks scheduling and resource allocation are among crucial issues in any large scale distributed system, including Computational Grids (CGs). These issues are commonly investigated using traditional computational models and resolution methods that yield near-optimal scheduling strategies. One drawback of such approaches is that they cannot effectively tackle the complex nature of CGs. On the one hand, such systems account for many administrative domains with their own access policies, user privileges, etc. On the other, CGs have hierarchical nature and therefore any computational model should be able to effectively express the hierarchical architecture in the optimization model. Recently, researchers have been investigating the use of game theory for modeling user requirements regarding task and resource allocation in grid scheduling problems. In this paper we present two general non-cooperative game approaches, namely, the symmetric non-zero sum game and the asymmetric Stackelberg game for modeling grid user behavior defined as user requirements. In our game-theoretic approaches we are able to cast new requirements arising in allocation problems, such as asymmetric users relations, security and reliability restrictions in CGs. For solving the games, we designed and implemented GA-based hybrid schedulers for approximating the equilibrium points for both games. The proposed hybrid resolution methods are experimentally evaluated through the grid simulator under heterogeneity, and large-scale and dynamics conditions. The relative performance of the schedulers is measured in terms of the makespan and flowtime metrics. The experimental analysis showed high efficiency of meta-heuristics in solving the game-based models, especially in the case of an additional cost of secure task scheduling to be paid by the users.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2011, 21, 2; 243-257
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Comparative simulation study of production scheduling in the hybrid and the parallel flow
    Autorzy:
    Varela, M. L. R.
    Trojanowska, J.
    Carmo-Silva, S.
    Costa, N. M. L.
    Machado, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/407017.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    approach for supporting manufacturing scheduling decision making
    heuristics
    hybrid flow shop
    parallel flow shops
    makespan
    Opis:
    Scheduling is one of the most important decisions in production control. An approach is proposed for supporting users to solve scheduling problems, by choosing the combination of physical manufacturing system configuration and the material handling system settings. The approach considers two alternative manufacturing scheduling configurations in a two stage product oriented manufacturing system, exploring the hybrid flow shop (HFS) and the parallel flow shop (PFS) environments. For illustrating the application of the proposed approach an industrial case from the automotive components industry is studied. The main aim of this research to compare results of study of production scheduling in the hybrid and the parallel flow, taking into account the makespan minimization criterion. Thus the HFS and the PFS performance is compared and analyzed, mainly in terms of the makespan, as the transportation times vary. The study shows that the performance HFS is clearly better when the work stations’ processing times are unbalanced, either in nature or as a consequence of the addition of transport times just to one of the work station processing time but loses advantage, becoming worse than the performance of the PFS configuration when the work stations’ processing times are balanced, either in nature or as a consequence of the addition of transport times added on the work stations’ processing times. This means that physical layout configurations along with the way transport time are including the work stations’ processing times should be carefully taken into consideration due to its influence on the performance reached by both HFS and PFS configurations.
    Źródło:
    Management and Production Engineering Review; 2017, 8, 2; 69-80
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Routing flow-shop with buffers and ready times - comparison of selected solution algorithms
    Autorzy:
    Józefczyk, J.
    Markowski, M.
    Balgabaeva, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/406986.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    manufacturing systems
    operations research
    complex systems
    optimization problems
    scheduling algorithms
    routing algorithms
    heuristics
    computer simulation
    Opis:
    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.
    Źródło:
    Management and Production Engineering Review; 2014, 5, 4; 26-35
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Production Scheduling for the Two Furnaces – One Casting Line System
    Autorzy:
    Stawowy, A.
    Duda, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/383276.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    heuristics
    application of information technology
    foundry industry
    scheduling
    production planning
    heurystyka
    zastosowanie technologii informatycznej
    przemysł odlewniczy
    planowanie
    planowanie produkcji
    Opis:
    The paper presents a production scheduling problem in a foundry equipped with two furnaces and one casting line, where the line is a bottleneck and furnaces, of the same capacity, work in parallel. The amount of produced castings may not exceed the capacity of the line and the furnaces, and their loads determine metal type from which the products are manufactured on the casting line. The purpose of planning is to create the processing order of metal production to prevent delays in the delivery of the ordered products to the customers. The problem is a mix of a lot-sizing and scheduling problems on two machines (the furnaces) run in parallel. The article gives a mathematical model that defines the optimization problem, and its relaxed version based on the concept of a rolling-horizon planning. The proposed approaches, i.e. commercial solver and Iterated Local Search (ILS) heuristic, were tested on a sample data and different problem sizes. The tests have shown that rolling horizon approach gives the best results for most problems, however, developed ILS algorithm gives better results for the largest problem instances with tight furnace capacity.
    Źródło:
    Archives of Foundry Engineering; 2020, 20, 1; 43-48
    1897-3310
    2299-2944
    Pojawia się w:
    Archives of Foundry Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Coordinated Production Planning and Scheduling Problem in a Foundry
    Autorzy:
    Stawowy, A.
    Duda, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/381726.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    foundry industry
    application of information technology
    production planning
    scheduling
    heuristics
    przemysł odlewniczy
    zastosowanie technologii informatycznych
    planowanie produkcji
    planowanie skoordynowane
    Opis:
    In the paper, we present a coordinated production planning and scheduling problem for three major shops in a typical alloy casting foundry, i.e. a melting shop, molding shop with automatic line and a core shop. The castings, prepared from different metal, have different weight and different number of cores. Although core preparation does not required as strict coordination with molding plan as metal preparation in furnaces, some cores may have limited shelf life, depending on the material used, or at least it is usually not the best organizational practice to prepare them long in advance. Core shop have limited capacity, so the cores for castings that require multiple cores should be prepared earlier. We present a mixed integer programming model for the coordinated production planning and scheduling problem of the shops. Then we propose a simple Lagrangian relaxation heuristic and evolutionary based heuristic to solve the coordinated problem. The applicability of the proposed solution in industrial practice is verified on large instances of the problem with the data simulating actual production parameters in one of the medium size foundry.
    Źródło:
    Archives of Foundry Engineering; 2017, 17, 3; 133-138
    1897-3310
    2299-2944
    Pojawia się w:
    Archives of Foundry Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Iterated Local Search for Foundry Lot-sizing and Scheduling Problem with Setup Costs
    Autorzy:
    Stawowy, A.
    Duda, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/379789.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    information technology
    foundry industry
    scheduling problem
    production planning
    local search heuristics
    technologia informatyczna
    przemysł odlewniczy
    szeregowanie zadań
    planowanie produkcji
    wyszukiwanie lokalne
    Opis:
    The paper presents a novel Iterated Local Search (ILS) algorithm to solve multi-item multi-family capacitated lot-sizing problem with setup costs independent of the family sequence. The model has a direct application to real production planning in foundry industry, where the goal is to create the batches of manufactured castings and the sequence of the melted metal loads to prevent delays in delivery of goods to clients. We extended existing models by introducing minimal utilization of furnace capacity during preparing melted alloy. We developed simple and fast ILS algorithm with problem-specific operators that are responsible for the local search procedure. The computational experiments on ten instances of the problem showed that the presence of minimum furnace utilization constraint has great impact on economic and technological conditions of castings production. For all test instances the proposed heuristic is able to provide the results that are comparable to state-of-the art commercial solver.
    Źródło:
    Archives of Foundry Engineering; 2017, 17, 4; 161-164
    1897-3310
    2299-2944
    Pojawia się w:
    Archives of Foundry Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Solving scheduling problems with integrated online sustainability observation using heuristic optimization
    Autorzy:
    Burduk, Anna
    Musiał, Kamil
    Balashov, Artem
    Batako, Andre
    Safonyk, Andrii
    Powiązania:
    https://bibliotekanauki.pl/articles/2173719.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    production scheduling
    sustainable development
    genetic algorithm
    meta-heuristics
    intelligent optimization methods of production systems
    tabu search
    harmonogramowanie produkcji
    zrównoważony rozwój
    algorytm genetyczny
    przeszukiwanie tabu
    metaheurystyki
    inteligentne metody optymalizacji systemów produkcyjnych
    Opis:
    The paper deals with the issue of production scheduling for various types of employees in a large manufacturing company where the decision-making process was based on a human factor and the foreman’s know-how, which was error-prone. Modern production processes are getting more and more complex. A company that wants to be competitive on the market must consider many factors. Relying only on human factors is not efficient at all. The presented work has the objective of developing a new employee scheduling system that might be considered a particular case of the job shop problem from the set of the employee scheduling problems. The Neuro-Tabu Search algorithm and the data gathered by manufacturing sensors and process controls are used to remotely inspect machine condition and sustainability as well as for preventive maintenance. They were used to build production schedules. The construction of the Neuro-Tabu Search algorithm combines the Tabu Search algorithm, one of the most effective methods of constructing heuristic algorithms for scheduling problems, and a self-organizing neural network that further improves the prohibition mechanism of the Tabu Search algorithm. Additionally, in the paper, sustainability with the use of Industry 4.0 is considered. That would make it possible to minimize the costs of employees’ work and the cost of the overall production process. Solving the optimization problem offered by Neuro-Tabu Search algorithm and real-time data shows a new way of production management.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 6; art. no. e143830
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-11 z 11

      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