지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 대한산업공학회 Industrial Engineering & Management Systems Industrial Engineering & Management Systems 제12권 제2호
- 발행연도
- 2013.6
- 수록면
- 151 - 160 (10page)
이용수
초록· 키워드
오류제보하기
In the past decades, several algorithms based on evolutionary approaches have been proposed for solving job shop scheduling problems (JSP), which is well-known as one of the most difficult combinatorial optimization problems. Most of them have concentrated on finding optimal solutions of a single objective, i.e., makespan, or total weighted tardiness. However, real-world scheduling problems generally involve multiple objectives which must be considered simultaneously. This paper proposes an efficient particle swarm optimization based approach to find a Pareto front for multi-objective JSP. The objective is to simultaneously minimize makespan and total tardiness of jobs. The proposed algorithm employs an Elite group to store the updated non-dominated solutions found by the whole swarm and utilizes those solutions as the guidance for particle movement. A single swarm with a mixture of four groups of particles with different movement strategies is adopted to search for Pareto solutions. The performance of the proposed method is evaluated on a set of benchmark problems and compared with the results from the existing algorithms. The experimental results demonstrate that the proposed algorithm is capable of providing a set of diverse and high-quality nondominated solutions.
목차
ABSTRACT
1. INTRODUCTION
2. PROBLEM DESCRIPTION
3. PARTICLE SWARM OPTIMIZAIOTN
4. MOPSO ALGORITHM
5. EEPERIMENTAL RESULTS
6. CONCLUSION
REFERENCES
참고문헌 (30)
참고문헌 신청
1. [학술지(정기간행물)] - Bean, J. C. / 1994 / Genetic algorithms and random keys for sequencing and optimization / INFORMS Journal on Computing 6 (2) : 154 ~ 160
2. [학술지(정기간행물)] - Bierwirth, C. / 1995 / A generalized permutation approach to job shop scheduling with genetic algorithms / Operations-Research-Spektrum 17 (2/3) : 87 ~ 92
3. [학술지(정기간행물)] - Cheng, R. / 1996 / A tutorial survey of job-shop scheduling problems using genetic algorithms : I. representation / Computers and Industrial Engineering 30 (4) : 983 ~ 997
4. [학술대회논문] - Chiang, T. C. / 2006 / Multiobjective job shop scheduling using genetic algorithm with cyclic fitness assignment / Proceedings of the IEEE Congress on Evolutionary Computation : 3266 ~ 3273
5. [학술지(정기간행물)] - Deb, K. / 2002 / A fast and elitist multiobjective genetic algorithm : NSGA-II / IEEE Transactions on Evolutionary Computation 6 (2) : 182 ~ 197
2. [학술지(정기간행물)] - Bierwirth, C. / 1995 / A generalized permutation approach to job shop scheduling with genetic algorithms / Operations-Research-Spektrum 17 (2/3) : 87 ~ 92
3. [학술지(정기간행물)] - Cheng, R. / 1996 / A tutorial survey of job-shop scheduling problems using genetic algorithms : I. representation / Computers and Industrial Engineering 30 (4) : 983 ~ 997
4. [학술대회논문] - Chiang, T. C. / 2006 / Multiobjective job shop scheduling using genetic algorithm with cyclic fitness assignment / Proceedings of the IEEE Congress on Evolutionary Computation : 3266 ~ 3273
5. [학술지(정기간행물)] - Deb, K. / 2002 / A fast and elitist multiobjective genetic algorithm : NSGA-II / IEEE Transactions on Evolutionary Computation 6 (2) : 182 ~ 197
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2014-500-003300970