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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 19
Tytuł:
Towards job-shop scheduling with the use of virtual manufacturing cells
Autorzy:
Wojakowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/409306.pdf
Data publikacji:
2014
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
virtual manufacturing cell
job-shop scheduling
Opis:
The article presents the possibility to modify finding solutions when job-shop scheduling is conducted based on the idea of virtual cellular manufacturing. It is demonstrated that creation of virtual manufacturing cells for defined production orders and exploiting them in the process of job-shop scheduling allows to reduce makespan. In a virtual manufacturing cell, machines are dedicated to produce for selected production orders as in a regular manufacturing cell, but machines are not physically allocated in designated area. Virtual cell configurations are therefore temporary, and assignments are made to optimize the scheduling objective under changing demand conditions. In this research, an example of job-shop scheduling problem with embedded virtual cellular manufacturing is presented. The conditions of application of virtual manufacturing cells in terms of production flow modification are described.
Źródło:
Research in Logistics & Production; 2014, 4, 4; 331-339
2083-4942
2083-4950
Pojawia się w:
Research in Logistics & Production
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of Job Shop Scheduling Problem by Genetic Algorithms: Case Study
Autorzy:
Sahar, Habbadi
Herrou, Brahim
Sekkat, Souhail
Powiązania:
https://bibliotekanauki.pl/articles/24200523.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
optimization
metaheuristics
scheduling
job shop scheduling problem
genetic algorithms
simulation
Opis:
The Job Shop scheduling problem is widely used in industry and has been the subject of study by several researchers with the aim of optimizing work sequences. This case study provides an overview of genetic algorithms, which have great potential for solving this type of combinatorial problem. The method will be applied manually during this study to understand the procedure and process of executing programs based on genetic algorithms. This problem requires strong decision analysis throughout the process due to the numerous choices and allocations of jobs to machines at specific times, in a specific order, and over a given duration. This operation is carried out at the operational level, and research must find an intelligent method to identify the best and most optimal combination. This article presents genetic algorithms in detail to explain their usage and to understand the compilation method of an intelligent program based on genetic algorithms. By the end of the article, the genetic algorithm method will have proven its performance in the search for the optimal solution to achieve the most optimal job sequence scenario.
Źródło:
Management and Production Engineering Review; 2023, 14, 3; 44--56
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
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ł:
Optimization of sugar dispatching process
Autorzy:
Pytlak, R.
Powiązania:
https://bibliotekanauki.pl/articles/409091.pdf
Data publikacji:
2014
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
job shop scheduling
optimization in logistics
CLP in scheduling
constraint programming
Źródło:
Research in Logistics & Production; 2014, 4, 2; 105-118
2083-4942
2083-4950
Pojawia się w:
Research in Logistics & Production
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Specify of bottlenecks in conditions of unit and small-batch production
Autorzy:
Matuszek, J.
Mleczko, J.
Powiązania:
https://bibliotekanauki.pl/articles/384661.pdf
Data publikacji:
2009
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
Theory of Constraints
job shop scheduling
moving bottlenecks
heuristic algorithm
Opis:
The manufacturing industry has evolved over the past several decades in response to changing customer needs. Customers have become more demanding and want products that can meet their specific individual requirements. The standard products previously produced in large batches are not sufficient to meet this variety demanded. Given the increased competition, both locally and globally, companies must also now respond faster to get and keep customers. Enterprises were forced to unit and small-batch production. Currently, advanced planning systems are coming into use, however their cost exceeds the possibilities of small and medium enterprises and algorithms used often require great customization to industries' needs and conditions of unit and small-batch production. The paper has been drawn on the basis of research on overloads of moving bottlenecks in conditions of unit and small batch production in real conditions having a big number of resources and tasks. The methods used so far are not capable of finding the global optimum of such big data ranges. The author took on building a heuristic algorithm, which could find solution good enough and based on TOC (Theory of Constraints) assumptions and verification of assumptions using tests in real production systems. The above method found application to the industrial scale, as extension of the ERP class system.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2009, 3, 3; 102-109
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
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ł:
Meta-heuristic approach based on genetic and greedy algorithms to solve flexible job-shop scheduling problem
Autorzy:
Rezaeipanah, Amin
Sarhangnia, Fariba
Abdollahi, Mohammad Javad
Powiązania:
https://bibliotekanauki.pl/articles/2097966.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
job-shop scheduling
meta-heuristic method
genetic algorithm
greedy algorithm
jobs priority
Opis:
Job-shop scheduling systems are one of the applications of group technology in industry, the purpose of which is to take advantage of the physical or operational similarities of products in their various aspects of construction and design. Additionally, these systems are identified as cellular manufacturing systems (CMS). In this paper, a meta-heuristic method that is based on combining genetic and greedy algorithms has been used in order to optimize and evaluate the performance criteria of the flexible job-shop scheduling problem. In order to improve the efficiency of the genetic algorithm, the initial population is generated by the greedy algorithm, and several elitist operators are used to improve the solutions. The greedy algorithm that is used to improve the generation of the initial population prioritizes the cells and the job in each cell and, thus, offers quality solutions. The proposed algorithm is tested over the P-FJSP dataset and compared with the state-of-the-art techniques of this literature. To evaluate the performance of the diversity, spacing, quality, and run-time criteria were used in a multi-objective function. The results of the simulation indicate the better performance of the proposed method as compared to the NRGA and NSGA-II methods.
Źródło:
Computer Science; 2021, 22 (4); 463--488
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary algorithms for job-shop scheduling
Autorzy:
Mesghouni, K.
Hammadi, S.
Borne, P.
Powiązania:
https://bibliotekanauki.pl/articles/907245.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
harmonogramowanie produkcji
algorytm ewolucyjny
reprezentacja równoległa
job-shop scheduling
evolutionary algorithms
parallel representation
Opis:
This paper explains how to use Evolutionary Algorithms (EA) to deal with a flexible job shop scheduling problem, especially minimizing the makespan. The Job-shop Scheduling Problem (JSP) is one of the most difficult problems, as it is classified as an NP-complete one (Carlier and Chretienne, 1988; Garey and Johnson, 1979). In many cases, the combination of goals and resources exponentially increases the search space, and thus the generation of consistently good scheduling is particularly difficult because we have a very large combinatorial search space and precedence constraints between operations. Exact methods such as the branch and bound method and dynamic programming take considerable computing time if an optimum solution exists. In order to overcome this difficulty, it is more sensible to obtain a good solution near the optimal one. Stochastic search techniques such as evolutionary algorithms can be used to find a good solution. They have been successfully used in combinatorial optimization, e.g. in wire routing, transportation problems, scheduling problems, etc. (Banzhaf et al., 1998; Dasgupta and Michalewicz, 1997). Our objective is to establish a practical relationship between the development in the EA area and the reality of a production JSP by developing, on the one hand, two effective genetic encodings, such as parallel job and parallel machine representations of the chromosome, and on the other, genetic operators associated with these representations. In this article we deal with the problem of flexible job-shop scheduling which presents two difficulties: the first is the assignment of each operation to a machine, and the other is the scheduling of this set of operations in order to minimize our criterion (e.g. the makespan).
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 1; 91-103
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improving the TSAB algorithm through parallel computing
Autorzy:
Rudy, Jarosław
Pempera, Jaroslaw
Smutnicki, Czesław
Powiązania:
https://bibliotekanauki.pl/articles/229535.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
job shop scheduling
parallel computing
operations research
taboo search
TSAB algorithm
coarse-grained parallelization
Opis:
In this paper, a parallel multi-path variant of the well-known TSAB algorithm for the job shop scheduling problem is proposed. Coarse-grained parallelization method is employed, which allows for great scalability of the algorithm with accordance to Gustafon’s law. The resulting P-TSAB algorithm is tested using 162 well-known literature benchmarks. Results indicate that P-TSAB algorithm with a running time of one minute on a modern PC provides solutions comparable to the ones provided by the newest literature approaches to the job shop scheduling problem. Moreover, on average P-TSAB achieves two times smaller percentage relative deviation from the best known solutions than the standard variant of TSAB. The use of parallelization also relieves the user from having to fine-tune the algorithm. The P-TSAB algorithm can thus beused as module in real-life production planning systems or as a local search procedure in other algorithms. It can also provide the upper bound of minimal cycle time for certain problems of cyclic scheduling.
Źródło:
Archives of Control Sciences; 2020, 30, 3; 411-435
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Lower bounds for the scheduling problem with uncertain demands
Autorzy:
Berkoune, D.
Mesghouni, K.
Rabenasolo, B.
Powiązania:
https://bibliotekanauki.pl/articles/908409.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
szeregowanie zadań
prognozowanie popytu
granica dolna
flexible job shop scheduling
insertion
makespan
predicted demands
lower bounds
Opis:
This paper proposes various lower bounds to the makespan of the flexible job shop scheduling problem (FJSP). The FJSP is known in the literature as one of the most difficult combinatorial optimisation problems (NP-hard). We will use genetic algorithms for the optimisation of this type of problems. The list of the demands is divided in two sets: the actual demand, which is considered as certain (a list of jobs with known characteristics), and the predicted demand, which is a list of uncertain jobs. The actual demand is scheduled in priority by the genetic algorithm. Then, the predicted demand is inserted using various methods in order to generate different scheduling solutions. Two lower bounds are given for the makespan before and after the insertion of the predicted demand. The performance of solutions is evaluated by comparing the real values obtained on many static and dynamic scheduling examples with the corresponding lower bounds.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2006, 16, 2; 263-269
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The prioritisation of production orders under the bee colony algorithm
Szeregowanie zleceń produkcyjnych z zastosowaniem algorytmu pszczelego
Autorzy:
Jardzioch, A.
Bulwan, K.
Powiązania:
https://bibliotekanauki.pl/articles/176112.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
job shop scheduling
artificial bee colony algorithm
manufacturing system
szeregowanie zleceń produkcyjnych
algorytm pszczeli
system wytwarzania
Opis:
The paper presents the problem of determining the prioritisation of production orders. The proposed criterion function allows a comprehensive evaluation of various ways of prioritising taking into account both the income derived from the execution of production orders and the penalty for any delays which may occur. The criterion function was implemented in an algorithm based on the operation of a colony of bees. The experiments which have been carried out make it possible to evaluate the solutions obtained through the provided algorithm and compare them with the solutions obtained through the typical heuristic rules. The results show that the prioritisation obtained through the algorithm is characterized by the highest qualities of the criterion function and is definitely superior to that obtained through the simple heuristic rules.
W pracy przedstawiono zagadnienia ustalania kolejności wprowadzania zleceń do produkcji. Zaproponowano zastosowanie kompleksowej funkcji kryterialnej do oceny różnorodnych uszeregowań. Funkcja ta uwzględnia zarówno przychód uzyskany z realizacji zleceń produkcyjnych, jak i ewentualne kary za opóźnienia w ich wykonaniu. Opracowano algorytm oparty na działaniu roju pszczół, w którym zaimplantowano proponowaną funkcję kryterialną. Wykonane eksperymenty pozwoliły na ocenę uszeregowań uzyskiwanych z użyciem algorytmu pszczelego oraz ich porównanie z rozwiązaniami dla typowych reguł heurystycznych. Analiza otrzymanych wyników pozwoliła na stwierdzenie, że uszeregowania uzyskiwane z zastosowaniem opracowanego algorytmu cechowały się największymi wartościami funkcji kryterialnej. Zdecydowanie przewyższały uszeregowania uzyskiwane z wykorzystaniem prostych reguł heurystycznych.
Źródło:
Advances in Manufacturing Science and Technology; 2013, 37, 4; 49-59
0137-4478
Pojawia się w:
Advances in Manufacturing Science and Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optymalizacja procesu wysyłki cukru
Optimization of sugar dispatching proces
Autorzy:
Pytlak, R.
Stecz, W.
Powiązania:
https://bibliotekanauki.pl/articles/1378130.pdf
Data publikacji:
2014
Wydawca:
Polskie Wydawnictwo Ekonomiczne
Tematy:
systemy gniazdowe
optymalizacja procesów logistycznych
CLP w harmonogramowaniu
programowanie z ograniczeniami
job shop scheduling
optimization in logistics
CLP in scheduling
constraint programming
Opis:
We consider the sugar dispatching process at a sugar mill. The main goal of our work was to check an efficiency of the logistics system in the mill, find and correct the bottlenecks. Some methods for logistics processes optimization are presented. We base on the heuristics and CLP techniques for solving the scheduling problems. Some additional remarks about possibility of using the optimization methods in scheduling and logistics optimizations are presented too.
Źródło:
Gospodarka Materiałowa i Logistyka; 2014, 2; 21-30
1231-2037
Pojawia się w:
Gospodarka Materiałowa i Logistyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A fine-grained parallel algorithm for the cyclic flexible job shop problem
Autorzy:
Bożejko, W.
Pempera, J.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/229531.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
job shop
cyclic scheduling
parallel algorithm
Opis:
In this paper there is considered a flexible job shop problem of operations scheduling. The new, very fast method of determination of cycle time is presented. In the design of heuristic algorithm there was the neighborhood inspired by the game of golf applied. Lower bound of the criterion function was used in the search of the neighborhood.
Źródło:
Archives of Control Sciences; 2017, 27, 2; 169-181
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Firefly algorithm applied to the job-shop scheduling problem
Autorzy:
Świtalski, Piotr
Bolesta, Arkadiusz
Powiązania:
https://bibliotekanauki.pl/articles/2052416.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
scheduling
job shop
firefly algorithm
aitoa library
Opis:
The job shop scheduling problem (JSSP) is one of the most researched scheduling problems. This problem belongs to the NP-hard class. An optimal solution for this category of problems is rarely possible. We try to find suboptimal solutions using heuristics or metaheuristics. The firefly algorithm is a great example of a metaheuristic. In this paper, this algorithm is used to solve JSSP. We used some benchmarking JSSP datasets for experiments. The experimental program was implemented in the aitoa library. We investigated the optimal parameter settings of this algorithm in terms of JSSP. Analysis of the experimental results shows that the algorithm is useful to solve scheduling problems.
Źródło:
Studia Informatica : systems and information technology; 2021, 1-2(25); 87-100
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
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ł
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