Tabu search and genetic algorithm in rims production process assignment

Logic Journal of the IGPL (forthcoming)
  Copy   BIBTEX

Abstract

The paper discusses the problem of assignment production resources in executing a production order on the example of the car rims manufacturing process. The more resources are involved in implementing the manufacturing process and the more they can be used interchangeably, the more complex and problematic the scheduling process becomes. Special attention is paid to the effective scheduling and assignment of rim machining operations to production stations in the considered manufacturing process. In this case, the use of traditional scheduling methods based on simple calculations, or the know-how of process engineers often turns out to be insufficient to achieve the intended results. Due to the scale of the problems faced in practice, the methods based on approximate approaches (Genetic and Tabu Search) were used to solve them. In this perspective, the problem under consideration involves the extension of the classic assignment problem with the possibility of taking into account: the times of operations, potential changeovers and the capacity of production resources.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,075

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

距離に依存せずに多様性を制御する Ga による高次元関数最適化.Konagaya Akihiko Kimura Shuhei - 2003 - Transactions of the Japanese Society for Artificial Intelligence 18:193-202.

Analytics

Added to PP
2024-03-26

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references