A Multiobjective State Transition Algorithm for Single Machine Scheduling
Optimization and Control
2015-09-22 v1 Information Theory
Combinatorics
math.IT
Abstract
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.
Cite
@article{arxiv.1303.7015,
title = {A Multiobjective State Transition Algorithm for Single Machine Scheduling},
author = {Xiaojun Zhou},
journal= {arXiv preprint arXiv:1303.7015},
year = {2015}
}
Comments
10 pages, 4 figures