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-10 z 19
Tytuł:
Minimizing makespan in general flow-shop scheduling problem using a GA-based improvement heuristic
Autorzy:
Semančo, P.
Powiązania:
https://bibliotekanauki.pl/articles/117960.pdf
Data publikacji:
2011
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
flow-shop production
evolutionary algorithm
Opis:
In the paper an improvement heuristic is proposed for permutation flow-shop problem based on the idea of evolutionary algorithm. The approach employs constructive heuristic that gives a good initial solution. GA-based improvement heuristic is applied in conjunction with three well-known constructive heuristics, namely CDS, Gupta’s algorithm and Palmer’s Slope Index. The approach is tested on benchmark set of 10 problems range from 4 to 25 jobs and 4 to 30 machines. The results are also compared to the best-known lower-bound solutions.
Źródło:
Applied Computer Science; 2011, 7, 1; 57-64
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On a bicriteria optimal production plan
Autorzy:
Kuchta, D.
Powiązania:
https://bibliotekanauki.pl/articles/970401.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
production schedule
makespan
flow shop
open shop
Opis:
The classical mathematical programming problem used for the determination of a production plan maximising total income or profit is complemented with a second objective, concerning the makespan of the products being manufactured on two machines. As a result, a bicriterial integer linear programming problem is obtained, which can be solved by means of classical methods. A computational example is presented and discussed.
Źródło:
Control and Cybernetics; 2007, 36, 2; 357-366
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł:
Testing algorithms for quick rescheduling flow shop problems with FlexSim based simulation and R engine
Autorzy:
Janke, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/27313435.pdf
Data publikacji:
2023
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
flow-shop problem
genetic algorithm
simulation
problem przepływowy
algorytm genetyczny
symulacja
Opis:
Purpose: The aim of this paper is to present a combination of advanced algorithms for finding optimal solutions together with their tests for a permutation flow-shop problem with the possibilities offered by a simulation environment. Four time-constrained algorithms are tested and compared for a specific problem. Design/methodology/approach: Four time-constrained algorithms are tested and compared for a specific problem. The results of the work realisation of the algorithms are transferred to a simulation environment. The entire solution proposed in the work is composed as a parallel environment to the real implementation of the production process. Findings: The genetic algorithm generated the best solution in the same specified short time. By implementing the adopted approach, the correct cooperation of the FlexSim simulation environment with the R language engine was obtained. Research limitations/implications: The genetic algorithm generated the best solution in the same specified short time. By implementing the approach, a correct interaction between the FlexSim simulation environment and the R language engine was achieved. Practical implications: The solution proposed in this paper can be used as an environment to test solutions proposed in production. Simulation methods in the areas of logistics and production have for years attracted the interest of the scientific community and the wider industry. Combining the achievements of science in solving computationally complex problems with increasingly sophisticated algorithms, including artificial intelligence algorithms, with simulation methods that allow a detailed overview of the consequences of changes made seems promising. Originality/value: The original concept of cooperation between the R environment and the FlexSim simulation software for a specific problem was presented.
Źródło:
Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska; 2023, 168; 163--175
1641-3466
Pojawia się w:
Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorytm pszczeli w optymalizacji modelu przepływowego szeregowania zadań
Bees algorithm in optimization of task scheduling for flow shop model
Autorzy:
Popielarski, Wiesław
Powiązania:
https://bibliotekanauki.pl/articles/41204031.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Kazimierza Wielkiego w Bydgoszczy
Tematy:
algorytm pszczół
model przepływowy
szeregowanie zadań
bees algorithm
flow shop
task scheduling
Opis:
Problem optymalizacji przy ograniczonych zasobach jest jednym z podstawowych tematów w informatyce. Algorytm pszczeli z szerszej grupy algorytmów stadnych, wynaleziony i przedstawiony w połowie ostatniej dekady, wydaje się być obiecującym narzędziem w optymalizacji kombinatorycznej. Artykuł przedstawia wyniki badań nad algorytmem w optymalizacji modelu przepływowego szeregowania zadań i zakreśla dalsze ich obszary.
Problem of optimization with limited resources is fundamental one in computer sciences. The bees algorithm from wider group of swarm algorithms, invented and implemented about 2005, seems to be a good candidate for next useful tool for combinatorial optimization. Article presents the results of the bees algorithm research in flow shop model of task scheduling and outlines areas of further exploration
Źródło:
Studia i Materiały Informatyki Stosowanej; 2010, 2; 47-50
1689-6300
Pojawia się w:
Studia i Materiały Informatyki Stosowanej
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ł:
Blocks for two-machines total weighted tardiness flow shop scheduling problem
Autorzy:
Bożejko, W.
Uchroński, M.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/202179.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
flow shop
two machine
due date
minimal costs
blocks of tasks
parallel algorithm
Opis:
The paper discusses a two-machine flow shop problem with minimization of the sum of tardiness costs, being a a generalization of the popular NP-hard single-machine problem with this criterion. We propose the introduction of new elimination block properties allowing for accelerating the operation of approximate algorithms of local searches, solving this problem and improving the quality of solutions determined by them.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 1; 31-41
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
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ł
Wyświetlanie 1-10 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