2017
DOI: 10.17559/tv-20150527133957
|View full text |Cite
|
Sign up to set email alerts
|

An efficient genetic algorithm for job shop scheduling problems

Abstract: Preliminary communicationThe Job Shop Scheduling Problem (JSSP) is one of the most general and difficult of all traditional scheduling combinatorial problems with considerable importance in industry. When solving complex problems, search based on traditional genetic algorithms has a major drawback -high requirement for computational power. The goal of this research was to develop fast and efficient scheduling method based on genetic algorithm for solving the job-shop scheduling problems. In proposed GA initial… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…Production scheduling plays a vital role in planning and operation of a manufacturing system [23]. The Job Shop Scheduling Problem (JSSP) is one of the most general and difficult of all traditional scheduling combinatorial problems with considerable importance in industry [24]. Today, we can observe much pressure on enterprises from the market, the competition and the customer [25,26].…”
Section: Discussionmentioning
confidence: 99%
“…Production scheduling plays a vital role in planning and operation of a manufacturing system [23]. The Job Shop Scheduling Problem (JSSP) is one of the most general and difficult of all traditional scheduling combinatorial problems with considerable importance in industry [24]. Today, we can observe much pressure on enterprises from the market, the competition and the customer [25,26].…”
Section: Discussionmentioning
confidence: 99%
“…One of the applications of GA is the resourceconstrained project scheduling problems. Many researchers studied on this subject [8][9][10][11][12][13][14][15]. Davis and Patterson [16] solved a project consisting of 2 dummy activities and a total of 27 activities with GA and they compared the solution with the results of other heuristic methods.…”
Section: Introductionmentioning
confidence: 99%
“…The paper is a continuation research of already published papers by the same author [3][4][5][6] and follows the concept of presenting 3D truss latticed portals with L-beam elements. The basis for the development of the described GA method are general papers [7,8,9], papers about usage of GA in electrical application [10][11][12] and papers in the field of optimization of steel structures [13,14]. The program GAUSAB3D is developed in MATLAB, using Genetic Algorithm and Direct Search Toolbox.…”
Section: Introductionmentioning
confidence: 99%