doi: 10.4304/jsw.9.11.2948-2954
An Effective Method to Solve Flexible Job-shop Scheduling Based on Cloud Model
2Institute of Software, Dalian Jiaotong University, Dalian 116045,China
Abstract—In order to solve the problem of flexible job-shop scheduling, this paper proposed a novel quantum genetic algorithm based on cloud model. Firstly, a simulation model was established aiming at minimizing the completion time, the penalty and the total cost. Secondly, the method of double chains structure coding including machine allocation chain and process chain was proposed. The crossover operator and mutation operator were obtained by the cloud model X condition generator because of its randomness and stable tendency. The non dominated sorting strategy was introduced to obtain more optimal solution. Finally, the novel method was applied to the Kacem example and a mechanical mould scheduling, the simulation results demonstrated that the proposed method can reduce the precocious probability and obtain more non dominated solutions comparing with the existing algorithms.
Index Terms—Flexible job-shop scheduling, Cloud model, Quantum genetic algorithm, Double chains structure coding
Cite: Xiaobing Liu, Xuan Jiao, Tao Ning, Ming Huang, "An Effective Method to Solve Flexible Job-shop Scheduling Based on Cloud Model, " Journal of Software vol. 9, no. 11, pp. 2948-2954, 2014.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Mar 01, 2024 News!
Vol 19, No 1 has been published with online version [Click]