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.
CITATION STYLE
Zhou, X., Hanoun, S., Gao, D. Y., & Nahavandi, S. (2015). A multiobjective state transition algorithm for single machine scheduling. In Springer Proceedings in Mathematics and Statistics (Vol. 95, pp. 79–88). Springer New York LLC. https://doi.org/10.1007/978-3-319-08377-3_9
Mendeley helps you to discover research relevant for your work.