A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem

被引：0

作者：

Mariano Frutos

Ana Carolina Olivera

Fernando Tohmé

机构：

[1] CONICET,Department of Engineering

[2] Universidad Nacional del Sur,Department of Computer Science & Engineering

[3] CONICET,Department of Economics

[4] Universidad Nacional del Sur,undefined

[5] CONICET,undefined

[6] Universidad Nacional del Sur,undefined

来源：

Annals of Operations Research | 2010年 / 181卷

关键词：

Flexible job-shop scheduling problem; Memetic algorithms; NSGAII; Multi-objective optimization;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The Flexible Job-Shop Scheduling Problem is concerned with the determination of a sequence of jobs, consisting of many operations, on different machines, satisfying several parallel goals. We introduce a Memetic Algorithm, based on the NSGAII (Non-Dominated Sorting Genetic Algorithm II) acting on two chromosomes, to solve this problem. The algorithm adds, to the genetic stage, a local search procedure (Simulated Annealing). We have assessed its efficiency by running the algorithm on multiple objective instances of the problem. We draw statistics from those runs, which indicate that this Memetic Algorithm yields good and low-cost solutions.

引用

页码：745 / 765

页数：20

共 38 条

[1]

Adams J.(1988)The shifting bottleneck procedure for job-shop scheduling Management Science 34 391-401

[2]

Balas E.(2000)Tabu search for minimizing total tardiness in a job-shop International Journal of Production Economics 63 131-140

[3]

Zawack D.(1992)Scheduling algorithms to minimize utility work at a single station on paced assembly line Production Planning and Control 3 393-405

[4]

Armentano V. A.(1997)Applyng constraint satisfaction techniques to job-shop scheduling Annals of Operations Research 70 327-357

[5]

Scrich C. R.(1996)A tutorial survey of job-shop scheduling problems using genetic algorithms. Part I: representation Computers and Industrial Engineering 30 983-997

[6]

Bolat A.(2002)A fast and elitist multi-objective genetic algorithm: NSGAII IEEE Transactions on Evolutionary Computation 6 182-197

[7]

Yano C.(1983)Optimization by simulated annealing Science 220 671-680

[8]

Cheng C. C.(2007)Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem Applied Mathematics and Computation 187 989-998

[9]

Smith S. F.(2003)Balance between genetic search and local search in memetic algorithms for multiobjective permutation flow-shop scheduling IEEE Transactions on Evolutionary Computation 7 204-223

[10]

Cheng R.(2004)A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm Annals of Operations Research 131 135-158

← 1 2 3 4 →