Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: job shop scheduling problem

Sortuj według:

Ogranicz wyniki do:

Optimization of Job Shop Scheduling Problem by Genetic Algorithms: Case Study

Sahar Habbadi, Herrou Brahim, Sekkat Souhail

Management and Production Engineering Review

2023

Vol. 14, No. 3

44--56

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.

Harmonogramowanie produkcji w systemie gniazdowym z ograniczoną dostępnością maszyn: blokowa metoda podziału i ograniczeń

Gajoszek E., Książek R., Kaczmarczyk W.

Zeszyty Naukowe. Automatyka / Politechnika Śląska

2008

z. 151

111-117

W pracy przedstawiono blokową metodę podziału i ograniczeń do minimalizacji maksymalnej nieterminowości Lmax dla ogólnego zagadnienia gniazdowego z ograniczoną dostępnością maszyn i z podziałem partii. Zadanie sformułowano na potrzeby firmy produkującej części lotnicze. W pracy przedstawiono wyniki obliczeń dla kilkunastu kolejnych tygodni produkcji.

In this paper is presented a branch and bound algorithm using block properties to minimize maximal lateness Z,max in the general job shop scheduling problem with limited machine availability and lot splitting. This method has been implemented for some company producing aircraft parts. This paper presents results of scheduling for several consecutive weeks of production.

A Note on Disjunctive Graph Representation

Błażewicz J., Pesch E., Sterna M.

Bulletin of the Polish Academy of Sciences. Technical Sciences

1999

Vol. 47, nr 1

103-114

The paper is concerned with a new time and memory efficient representation of a disjunctive graph. The disjunctive graph is a popular model used for describing instances of the job shop scheduling problem. The proposed data structure has the form of a graph matrix and combines advantages of a few classical graph representations.