Founded in 1971 >
Chinese Sci-tech Core Periodicals >
British Science Abstracts (SA, INSPEC) Indexed Journals >
United States, Cambridge Scientific Abstract: Technology (CSA: T) Indexed Journals >
United States, Ulrich's Periodicals Directory(UPD)Indexed Journals >
United States, Cambridge Scientific Abstract: Natural Science (CSA: NS) Indexed Journals >
Poland ,Index of Copernicus(IC) Indexed Journals >
International Standard Serial Number:
ISSN 1001-4551
Sponsor:
Zhejiang University;
Zhejiang Machinery and Electrical Group
Edited by:
Editorial of Journal of Mechanical & Electrical Engineering
Chief Editor:
ZHAO Qun
Vice Chief Editor:
TANG ren-zhong,
LUO Xiang-yang
Tel:
86-571-87041360,87239525
Fax:
86-571-87239571
Add:
No.9 Gaoguannong,Daxue Road,Hangzhou,China
P.C:
310009
E-mail:
meem_contribute@163.com
Abstract: In order to solve the dynamic rescheduling problem of flexible workshop under the disturbance of urgent order production, a dynamic rescheduling method based on forced evolutionary genetic algorithm and memory priority processing channel was proposed to shorten the overall processing time. Firstly, the dynamic rescheduling problem was described and modeled. Then, aiming at the static scheduling problem of flexible workshop, a method of genetic probability and operation range changing adaptively with individuals was designed, and a static scheduling algorithm of forced evolutionary genetic algorithm was proposed. For the dynamic rescheduling problem under the disturbance of urgent orders, a priority processing channel with memory ability was set up. Finally, taking the 6-Piece workshop as the experimental background, the dynamic rescheduling method of flexible workshop was experimentally verified, namely, the static scheduling performance based on forced evolutionary genetic algorithm and the dynamic rescheduling performance based on memory priority channel were verified respectively. The experiment results show that the average processing time of the static scheduling scheme of the forced evolutionary genetic algorithm is 39.4 min, which is 4.57% less than that of the improved genetic algorithm and 6.85% less than that of the standard genetic algorithm. Under the working conditions of different expediting times and different workpiece expediting, the expedited order production time and overall processing time of memory priority processing channel are less than those of the greedy adaptive method. The results show that the rescheduling scheme based on memory priority processing channel takes into account the processing time of emergency orders and the processing time of overall orders.
Key words: flexible manufacturing system/cell; flexible workshop scheduling; order expediting disturbance; forced evolutionary genetic algorithm; memory priority processing channel; processing time
-
- Chinese Core Periodicals
-
- Chinese Sci-tech Core Periodicals
-
- SA, INSPEC Indexed
-
- CSA: T Indexed
-
- UPD:Indexed
-
Copyright 2010 Zhejiang Information Institute of Mechinery Industry All Rights Reserved
Technical Support：Hangzhou Bory science and technology
