This research considers a low carbon scheduling problem in unrelated parallel machines. To solve this problem, we first establish a low carbon scheduling mathematical model. Then an iterative ant optimization algorithm is presented. Furthermore, parameters of proposed iterative ant optimization algorithm are selected by Taguchi methods on generating test dataset. Finally, comparative experiments indicate the proposed iterative ant optimization algorithm has better performance on minimizing energy consumption as well as total tardiness.
목차
Abstract 1. Introduction 2. Problem Definition 3. Mathematical Model 4. Iterative Ant Colony Optimization (IACO) 4.1. Solution Construction 4.2. Machine Selection 4.3. Job Selection 4.4. Machine Reselection 4.5. Local Search 4.6. Pheromone Update 5. Computational Experiments and Results 5.1. Data Generation 5.2. Performance Measure 5.3. Comparative Results 6. Conclusion Acknowledgements References
키워드
ant optimizationenergy consumptionlow carbon schedulingUnrelated parallel machine
저자
Peng Liang [ School of Computer Science, GuangDong Polytechnic Normal University, Guangzhou, 510665, R&D Center, XingFa Aluminum Holdings Limited, Foshan, China ]
Corresponding Author
WenSi Chen [ School of Computer Science, GuangDong Polytechnic Normal University, Guangzhou, 510665 ]
MingQiang Luo [ School of Computer Science, GuangDong Polytechnic Normal University, Guangzhou, 510665 ]
ShuQin Chen [ School of Computer Science, GuangDong Polytechnic Normal University, Guangzhou, 510665 ]
보안공학연구지원센터(IJSH) [Science & Engineering Research Support Center, Republic of Korea(IJSH)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Smart Home
간기
격월간
pISSN
1975-4094
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Smart Home Vol.10 No.5