A multiobjective state transition algorithm for single machine scheduling

DOI10.1007/978-3-319-08377-3_9MaRDI QIDQ2942461zbMATH OpenOpenAlexFDO

Authors Xiaojun Zhou, Samer Hanoun, David Y. Gao, Saeid Nahavandi

Publication date 11 September 2015

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.7015

zbMATH Keywords

discrete state transition algorithmmultiobjective optimizationsingle machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Multi-objective and goal programming (90C29)

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.

Recommendations

• Particle swarm optimization based multi-objective job shop scheduling
• Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
• Multi-objective genetic algorithm for single machine scheduling problem under fuzziness
• An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
• A united search particle swarm optimization algorithm for multiobjective scheduling problem

Cited in

(2)

• State transition algorithm
• The principle of state transition algorithm and its applications

This page was built for publication: A multiobjective state transition algorithm for single machine scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942461)