Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 7
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

Encryption is one of the most effective methods of securing data confidentiality, whether stored on hard drives or transferred (e.g. by e-mail or phone call). In this paper a new state recovery attack with tabu search is introduced. Based on research and theoretical approximation it is shown that the internal state can be recovered after checking 252 internal states for RC4 and 2180 for VMPC.
Go to article

Authors and Affiliations

Iwona Polak
Marcin Boryczka
Download PDF Download RIS Download Bibtex

Abstract

In this paper, triangular lattice index-guiding photonic crystal fibres (PCFs) are synthesized to compensate the chromatic dispersion of a single mode fibre (SMF-28) for an 80 km optical link operating at 1.55 μm, by using a directed tabu search algorithm. Hole-to-hole distance, circular air-hole diameter, solid-core diameter, ring number and PCF length parameters are optimized for this purpose. Three synthesized PCFs with different physical parameters are compared in terms of their objective functions values, residual dispersions, compensation ratios and confinement losses.

Go to article

Authors and Affiliations

Fethallah Karim
Download PDF Download RIS Download Bibtex

Abstract

A classical algorithm Tabu Search was compared with Q Learning (named learning) with regards to the scheduling problems in the Austempered Ductile Iron (ADI) manufacturing process. The first part comprised of a review of the literature concerning scheduling problems, machine learning and the ADI manufacturing process. Based on this, a simplified scheme of ADI production line was created, which a scheduling problem was described for. Moreover, a classic and training algorithm that is best suited to solve this scheduling problem was selected. In the second part, was made an implementation of chosen algorithms in Python programming language and the results were discussed. The most optimal algorithm to solve this problem was identified. In the end, all tests and their results for this project were presented.
Go to article

Bibliography

[1] Yang, L., Jiang, G., Chen, X., Li, G., Li, T. & Chen, X. (2019). Design of integrated steel production scheduling knowledge network system. Claster Comput. 10197-10206.
[2] Żurada, J. Barski, M., Jędruch, W. (1996). Artificial Neural Networks. Fundamentals of theory and application. Warszawa: PWN. (in Polish).
[3] Janiak, A. (2006). Scheduling in computer and manufacturing systems. Warszawa: Wydawnictwa Komunikacji i Łączności.
[4] Smutnicki, C. (2002). Scheduling algorithms. Warszawa: Akademicka Oficyna Wydawnicza EXIT. (in Polish).
[5] Coffman, E.G. (1980). Task scheduling theory. Warszawa: Wydawnictwa Naukowo-Techniczne. (in Polish).
[6] Janczarek, M. (2011). Managing production processes in the enterprise. Lublin: Lubelskie Towarzystwo Naukowe. (in Polish).
[7] Szeliga, M. (2019) Practical machine learning. Warszawa: PWN. (in Polish).
[8] Raschka, S. (2018) Python machine learning. Gliwice: Helion. (in Polish).
[9] Choi, H-S, Kim, J-S. & Lee, D-H. (2011). Real-time scheduling for reentrant hybrid flow shops: A decision tree based mechanism and its application to a TFT-LCD line. Expert System with Application. 38, 3514-3521.
[10] Agarwal, A., Pirkul, H. & Jacob, V.S. (2003). Augmented neutral network for task scheduling. European Journal of Operational Research. 151, 481-502.
[11] Jain, A.S. & Meeran, S. (1998). Jop-shop scheduling using neutral networks. International Journal of Production Research. 36(5), 1249-1272
[12] Fonseca-Reyna, Y.C., Martinez-Jimenez, Y. & Nowe, A. (2017). Q-Learning algorithm performance for m-machine, n-jobs flow shop scheduling problems to minimize makespan, Revista Investigacion Operacional. 38(3), 281-290.
[13] Dewi, Andriansyah, & Syahriza, (2019). Optimization of flow shop scheduling problem using classic algorithm: case study, IOP Conf. Series: Materials Science and Engineering 506.
[14] Putatunda, K. (2001) Development of austempered ductile cast iron (ADI) with simultaneous high yield strength and fracture toughness by a novel two-step austempering process. Material Science and Engineering A. 315, 70-80.
[15] Dayong Han, Hubei Key, Qiuhua Tang; Zikai Zhang; Jun Cao, (2020). Energy-efficient integration optimization of production scheduling and ladle dispatching in steelmaking plants. IEEE Access. 8, 176170-176187.
[16] Perzyk, M. (2017). The use of production data mining methods in the diagnosis of the causes of product defects and disruptions in the production process. Utrzymanie Ruchu. 4, 45-47. (in Polish).
[17] Perzyk, M., Dybowski, B. & Kozłowski, J. (2019). Introducing advanced data analytics in perspective of industry 4.0 in a die casting foundry. Archives of Foundry Engineering. 19(1), 53-57.
[18] Yescas, M. (2003). Prediction of the Vickers hardness in austempered ductile irons using neural networks. International Journal of Cast Metals Research. 15(5), 513-521.
[19] Report on the contract no. U / 227/2014 implemented at the Foundry Research Institute. (in Polish).
Go to article

Authors and Affiliations

D. Wilk-Kołodziejczyk
1 2
ORCID: ORCID
K. Chrzan
2
ORCID: ORCID
K. Jaśkowiec
2
ORCID: ORCID
Z. Pirowski
2
ORCID: ORCID
R. Żuczek
2
ORCID: ORCID
A. Bitka
2
ORCID: ORCID
D. Machulec
3
ORCID: ORCID

  1. AGH University of Science and Technology, Al. A. Mickiewicza 30, 30-059 Krakow, Poland
  2. Łukasiewicz Research Network – Krakow Institute of Technology, 73 Zakopiańska Str., 30-418 Kraków, Poland
  3. AGH University of Science and Technology, Kraków, Poland
Download PDF Download RIS Download Bibtex

Abstract

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.
Go to article

Authors and Affiliations

Anna Burduk
1
ORCID: ORCID
Kamil Musiał
1
Artem Balashov
1
Andre Batako
2
Andrii Safonyk
3
ORCID: ORCID

  1. Wroclaw University of Science and Technology, Faculty of Mechanical Engineering, Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, Poland
  2. Liverpool John Moores University, Faculty of Engineering and Technology,70 Mount Pleasant Liverpool L3 3AF, UK
  3. National University of Water and Environmental Engineering, Department of Automation, Electrical Engineering and Computer-Integrated Technologies, Rivne 33000, Ukraine
Download PDF Download RIS Download Bibtex

Abstract

This issue is a typical NP-hard problem for an unrelated parallel machine scheduling problem with makespan minimization as the goal and no sequence-related preparation time. Based on the idea of tabu search (TS), this paper improves the iterative greedy algorithm (IG) and proposes an IG-TS algorithm with deconstruction, reconstruction, and neighborhood search operations as the main optimization process. This algorithm has the characteristics of the strong capability of global search and fast speed of convergence. The warp knitting workshop scheduling problem in the textile industry, which has the complex characteristics of a large scale, nonlinearity, uncertainty, and strong coupling, is a typical unrelated parallel machine scheduling problem. The IG-TS algorithm is applied to solve it, and three commonly used scheduling algorithms are set as a comparison, namely the GA-TS algorithm, ABC-TS algorithm, and PSO-TS algorithm. The outcome shows that the scheduling results of the IG-TS algorithm have the shortest manufacturing time and good robustness. In addition, the production comparison between the IG-TS algorithm scheduling scheme and the artificial experience scheduling scheme for the small-scale example problem shows that the IG-TS algorithm scheduling is slightly superior to the artificial experience scheduling in both planning and actual production. Experiments show that the IG-TS algorithm is feasible in warp knitting workshop scheduling problems, effectively realizing the reduction of energy and the increase in efficiency of a digital workshop in the textile industry.
Go to article

Authors and Affiliations

Xinfu Chi
1
ORCID: ORCID
Shijing Liu
1
Ce Li
1

  1. Dong Hua University, College of Mechanical Engineering, Shanghai 201620, China
Download PDF Download RIS Download Bibtex

Abstract

Improving production processes includes not only activities concerning manufacturing itself, but also all the activities that are necessary to achieve the main objectives. One such activity is transport, which, although a source of waste in terms of adding value to the product, is essential to the realization of the production process. Over the years, many methods have been developed to help manage supply and transport in such a way as to reduce it to the necessary minimum. In the paper, the problem of delivering components to a production area using trains and appropriately laid-out carriages was described. It is a milk run stop locations problem (MRSLP), whose proposed solution is based on the use of heuristic algorithms. Intelligent solutions are getting more and more popular in the industry because of the possible advantages they offer, especially those that include the possibility of finding an optimum local solution in a relatively short time and the prevention of human errors. In this paper, the applicability of three algorithms – tabu search, genetic algorithm, and simulated annealing – was explored.
Go to article

Authors and Affiliations

Joanna Kochańska
1
Anna Burduk
1
ORCID: ORCID
Dagmara Łapczyńska
1
Kamil Musiał
1

  1. Faculty of Mechanical Engineering, Wroclaw University of Science and Technology, 50-370 Wroclaw, Poland
Download PDF Download RIS Download Bibtex

Abstract

We consider the real-life problem of planning tasks for teams in a corporation, in conditions of some restrictions. The problem takes into account various constraints, such as for instance flexible working hours, common meeting periods, time set aside for self-learning, lunchtimes and periodic performance of tasks. Additionally, only a part of the team may participate in meetings, and each team member may have their own periodic tasks such as self-development. We propose an algorithm that is an extension of the algorithm dedicated for scheduling on parallel unrelated processors with the makespan criterion. Our approach assumes that each task can be defined by a subset of employees or an entire team. However, each worker is of a different efficiency, so task completion times may differ. Moreover, the tasks are prioritized. The problem is NP-hard. Numerical experiments cover benchmarks with 10 instances of 100 tasks assigned to a 5-person team. For all instances, various algorithms such as branch-and-bound, genetic and tabu search have been tested.
Go to article

Authors and Affiliations

Marek Bazan
1 2
Czesław Smutnicki
1
Maciej E. Marchwiany
2

  1. Wroclaw University of Scienceand Technology, Department of Computer Engineering, Wrocław, Poland
  2. JT Weston sp. z o.o. Warszawa, Poland

This page uses 'cookies'. Learn more