2004
DOI: 10.1016/s0377-2217(03)00016-x
|View full text |Cite
|
Sign up to set email alerts
|

An efficient genetic algorithm for job shop scheduling with tardiness objectives

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
65
0
2

Year Published

2005
2005
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 141 publications
(68 citation statements)
references
References 18 publications
1
65
0
2
Order By: Relevance
“…Examples of artificial problems are the wellknown moving peaks benchmark [28,29]; dynamic versions of static continuous functions like Sphere, Griewank, Rastrigin, Ackley, etc. [23]; or dynamic versions of combinatorial problems as knapsack problem [3,21,35], moving parabola [1], bitwise comparison problems [10,41], and planning problems [8,11,26,37,38].…”
Section: F(t) Is the Set Of Feasible Solutions At Time T F(t) ⊂ Smentioning
confidence: 99%
“…Examples of artificial problems are the wellknown moving peaks benchmark [28,29]; dynamic versions of static continuous functions like Sphere, Griewank, Rastrigin, Ackley, etc. [23]; or dynamic versions of combinatorial problems as knapsack problem [3,21,35], moving parabola [1], bitwise comparison problems [10,41], and planning problems [8,11,26,37,38].…”
Section: F(t) Is the Set Of Feasible Solutions At Time T F(t) ⊂ Smentioning
confidence: 99%
“…Processing of 'O j,(i+1) ' cannot begin until the processing of 'O j,i ' gets finished i.e., pre-emption is illegal. Proposed work accounts F.J.S.S, which is N.P hard in nature, is more complex than classical J.S.S [22]. Because of addition of multiple process plans in F.J.S.S, complexity increases.…”
Section: Introductionmentioning
confidence: 99%
“…Recent researches have mostly focused on more advanced heuristic algorithms, better known as "metaheuristics", which propose several approaches like the tabu search [16][17][18][19], simulated annealing [20][21][22], ant colony optimization [23][24][25][26], particle swarm optimization [27][28][29][30], neuronal network [31,32], and genetic algorithms (GA). In particular, the GA are based on Darwin's evolutionary theory, and they have been employed to provide successful solutions to various combinatorial problems (JSP included [33][34][35][36]) since they allow exploring in an efficient way the solution space; nevertheless, they may converge prematurely. That is why recent researches have aimed to combine the GA with other techniques that ameliorate its efficiency by developing hybrid methods as the Memetic Algorithm (MA).…”
Section: Introductionmentioning
confidence: 99%