A multiobjective state transition algorithm for single machine scheduling
Zhou, Xiaojun, Hanoun, Samer, Gao, David Yang and Nahavandi, Saeid 2015, A multiobjective state transition algorithm for single machine scheduling, in ICONIP 2015 : Proceedings of the 22nd International Conference on Neural Information Processing, Springer, New York, N.Y., pp. 79-88, doi: 10.1007/978-3-319-08377-3_9.
Attached Files
Name
Description
MIMEType
Size
Downloads
Title
A multiobjective state transition algorithm for single machine scheduling
In this paper, a discrete state transition algorithm is introduced to solve a multiobjective single machine job shop scheduling problem. In the proposed approach, a non-dominated sort technique is used to select the best from a candidate state set, and a Pareto archived strategy is adopted to keep all the non-dominated solutions. Compared with the enumeration and other heuristics, experimental results have demonstrated the effectiveness of the multiobjective state transition algorithm.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.