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ę "flow shop" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    Tytuł:
    Exploring heuristic techniques for flow shop scheduling
    Autorzy:
    Soltysova, Zuzana
    Semanco, Pavol
    Modrak, Jan
    Powiązania:
    https://bibliotekanauki.pl/articles/407377.pdf
    Data publikacji:
    2019
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    benchmarking
    flow shop
    makespan
    relative percent deviation
    heuristics
    Opis:
    This paper explores selected heuristics methods, namely CDS, Palmer’s slope index, Gupta’s algorithm, and concurrent heuristic algorithm for minimizing the makespan in permutation flow shop scheduling problem. Its main scope is to explore how different instances sizes impact on performance variability. The computational experiment includes 12 of available benchmark data sets of 10 problems proposed by Taillard. The results are computed and presented in the form of relative percentage deviation, while outputs of the NEH algorithm were used as reference solutions for comparison purposes. Finally, pertinent findings are commented.
    Źródło:
    Management and Production Engineering Review; 2019, 10, 3; 54--60
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Minimizing the Makespan and Total Tardiness in Hybrid Flow Shop Scheduling with Sequence-Dependent Setup Times
    Autorzy:
    Mousavi, Seyyed Mostafa
    Shahnazari-Shahrezaei, Parisa
    Powiązania:
    https://bibliotekanauki.pl/articles/2201180.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    dispatching rule
    genetic algorithm
    hybrid flow shop
    neighborhood search structure
    Opis:
    The paper considers the production scheduling problem in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimizing both the makespan and the total tardiness. The multi-objective genetic algorithm is applied to solve this problem, which belongs to the non-deterministic polynomial-time (NP)-hard class. In the structure of the proposed algorithm, the initial population, neighborhood search structures and dispatching rules are studied to achieve more efficient solutions. The performance of the proposed algorithm compared to the efficient algorithm available in literature (known as NSGA-II) is expressed in terms of the data envelopment analysis method. The computational results confirm that the set of efficient solutions of the proposed algorithm is more efficient than the other algorithm.
    Źródło:
    Management and Production Engineering Review; 2023, 14, 1; 13--24
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Combination of Association Rules and Optimization Model to Solve Scheduling Problems in an Unstable Production Environment
    Autorzy:
    Del Gallo, Mateo
    Ciarapica, Filippo Emanuele
    Mazzuto, Giovanni
    Bevilacqua, Maurizio
    Powiązania:
    https://bibliotekanauki.pl/articles/27324213.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    data mining
    association rules
    optimization model
    production scheduling
    job-shop scheduling
    flow shop scheduling
    Opis:
    Production problems have a significant impact on the on-time delivery of orders, resulting in deviations from planned scenarios. Therefore, it is crucial to predict interruptions during scheduling and to find optimal production sequencing solutions. This paper introduces a selflearning framework that integrates association rules and optimisation techniques to develop a scheduling algorithm capable of learning from past production experiences and anticipating future problems. Association rules identify factors that hinder the production process, while optimisation techniques use mathematical models to optimise the sequence of tasks and minimise execution time. In addition, association rules establish correlations between production parameters and success rates, allowing corrective factors for production quantity to be calculated based on confidence values and success rates. The proposed solution demonstrates robustness and flexibility, providing efficient solutions for Flow-Shop and Job-Shop scheduling problems with reduced calculation times. The article includes two Flow-Shop and Job-Shop examples where the framework is applied.
    Źródło:
    Management and Production Engineering Review; 2023, 14, 4; 56--70
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    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ł:
    Evolutionary algorithm for minmax regret flow-shop problem
    Autorzy:
    Ćwik, M.
    Józefczyk, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/406859.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    manufacturing
    flow-shop
    interval uncertainty
    min-max regret
    heuristic algorithms
    evolutionary algorithms
    simulation
    Opis:
    The uncertain flow-shop is considered. It is assumed that processing times are not given a priori, but they belong to intervals of known bounds. The absolute regret (regret) is used to evaluate a solution (a schedule) which gives the minmax regret binary optimization problem. The evolutionary heuristic solution algorithm is experimentally compared with a simple middle interval heuristic algorithm for three machines instances. The conducted simulations confirmed the several percent advantage of the evolutionary approach.
    Źródło:
    Management and Production Engineering Review; 2015, 6, 3; 3-9
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An optimum scheduling method for multi-option product flows through production lineswithout intermediate buffers
    Autorzy:
    Magiera, Marek
    Powiązania:
    https://bibliotekanauki.pl/articles/406718.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    Flexible Manufacturing Systems
    integer programming
    linear programming
    no-wait scheduling
    hybrid flow shop
    makespan
    decision making
    Opis:
    The presented method is constructed for optimum scheduling in production lines with parallel machines and without intermediate buffers. The production system simultaneously performs operations on various types of products. Multi-option products were taken into account – products of a given type may differ in terms of details. This allows providing for individual requirements of the customers. The one-level approach to scheduling for multioption products is presented. The integer programming is used in the method – optimum solutions are determined: the shortest schedules for multi-option products. Due to the lack of the intermediate buffers, two possibilities are taken into account: no-wait scheduling, possibility of the machines being blocked by products awaiting further operations. These two types of organizing the flow through the production line were compared using computational experiments, the results of which are presented in the paper.
    Źródło:
    Management and Production Engineering Review; 2020, 11, 1; 86-94
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-6 z 6

      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