- Title
- A multiobjective state transition algorithm for single machine scheduling
- Creator
- Zhou, Xiaojun; Hanoun, Samer; Gao, David; Nahavandi, Saeid
- Date
- 2015
- Type
- Text; Conference paper
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/81623
- Identifier
- vital:8276
- Identifier
-
https://doi.org/10.1007/978-3-319-08377-3_9
- Identifier
- ISBN:21941009 (ISSN); 9783319083766 (ISBN)
- Identifier
- https://arxiv.org/pdf/1303.7015
- 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. © Springer International Publishing Switzerland 2015.
- Publisher
- Springer New York LLC
- Relation
- 3rd World Congress on Global Optimization in Engineering and Science, WCGO 2013; Anhui, China; 8th-12th July 2013 Vol. 95, p. 79-88
- Rights
- Copyright © Springer International Publishing Switzerland 2015
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- Discrete state transition algorithm; Multiobjective optimization; Single machine scheduling; Algorithms; Global optimization; Job shop scheduling; Machinery; Optimization; Scheduling algorithms; Discrete state; Job shop scheduling problems; Multi objective; Non-dominated sorts; Nondominated solutions; Single- machines; State transitions; Scheduling
- Reviewed
- Hits: 2810
- Visitors: 2709
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|