Minimization of Weighted Tardiness and Makespan in an Open shop Environment by a Novel Hybrid Multi-objective Meta-heuristic Method
被引:6
作者:
Tavakkoli-Moghaddam, R.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Tehran, Coll Engn, Dept Ind Engn, Tehran, IranUniv Tehran, Coll Engn, Dept Ind Engn, Tehran, Iran
Tavakkoli-Moghaddam, R.
[1
]
Panahi, H.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Tehran, Coll Engn, Dept Ind Engn, Tehran, IranUniv Tehran, Coll Engn, Dept Ind Engn, Tehran, Iran
Panahi, H.
[1
]
Heydar, M.
论文数: 0引用数: 0
h-index: 0
机构:
Islamic Azad Univ, Grad Sch Engn, Dept Ind Engn, Tehran, IranUniv Tehran, Coll Engn, Dept Ind Engn, Tehran, Iran
Heydar, M.
[2
]
机构:
[1] Univ Tehran, Coll Engn, Dept Ind Engn, Tehran, Iran
[2] Islamic Azad Univ, Grad Sch Engn, Dept Ind Engn, Tehran, Iran
来源:
IEEM: 2008 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-3
|
2008年
关键词:
Ant colony optimization;
Multi-objective;
Open shop scheduling;
D O I:
10.1109/IEEM.2008.4737895
中图分类号:
F [经济];
学科分类号:
02 ;
摘要:
This paper considers an open shop scheduling problem that minimizes bi-objectives, namely makespan and weighted tardiness. This problem, due to its complexity, is ranked in a class of NP-hard problems. In this case, traditional approaches cannot reach to an optimal solution in a reasonable time. Thus, we propose an efficient meta-heuristic method by hybridizing a multi-objective simulated annealing and ant colony optimization in order to solve the given problem. Two efficient local searches are also designed and applied to improve solution quality. Finally, we compare our computational results with a well-known multiobjective genetic algorithm, namely NSGA II. Comparisons are made in single objective case as well. The outputs show encouraging results in the form of solution quality.