Modeling and Scheme Generation of Dynamic Flexible Job-Shop Scheduling

Article Preview

Abstract:

Aiming at uncertain information and dynamic characteristic during flexible job-shop scheduling process, some kind of dynamic scheduling method for flexible job-shop scheduling problem (FJSP) is put forward based on real-time adjustment. A dynamic simulation solution mode framework is presented for FJSP. This framework is inspired by adaptive control, combined with the robust scheduling and foreseeing scheduling. It has both advantages of such two scheduling methods, and its stable and highly efficient. Preliminary scheme generation method based on foreseeing dynamics scheduling is introduced then. Foreseeing function is realized by fault-handling algorithm and dynamic simulation solver on the basis of Adaptive Genetic Algorithm (AGA).

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2232-2236

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] G.H. Zhang, X. Y. Shao, P.G. Li and L. Gao. An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem[J]. Computers & Industrial Engineering. Vol. 56(2009), pp.1309-1318.

DOI: 10.1016/j.cie.2008.07.021

Google Scholar

[2] M. Yazdani, M. Zandieh and M. Amiri. Flexible Job-shop Scheduling with Parallel Variable Neighborhood Search Algorithm[J]. Expert Systems with Applications Vol. 37(2010), pp.678-687.

DOI: 10.1016/j.eswa.2009.06.007

Google Scholar

[3] Rajabinasab A, Mansour S. Dynamic flexible job shop scheduling with alternative process plans: an agent-based approach[J]. The International Journal of Advanced Manufacturing Technology, Vol. 54(2011), pp.1091-1107.

DOI: 10.1007/s00170-010-2986-7

Google Scholar

[4] L.N. Xing, Y.W. Chen, P. Wang. A knowledge-based ant colony optimization for flexible job shop scheduling problems[J]. Applied Soft Computing Vol. 10(2010), pp.888-896.

DOI: 10.1016/j.asoc.2009.10.006

Google Scholar

[5] Xing L N, Chen Y W, Yang K W. An efficient search method for multi-objective flexible job shop scheduling problems[J]. Journal of Intelligent Manufacturing Vol. 20( 2009), pp.283-293.

DOI: 10.1007/s10845-008-0216-z

Google Scholar

[6] Bagheri A, Zandieh M, Mahdavi I. An artificial immune algorithm for the flexible job-shop scheduling problem[J]. Future Generation Computer Systems Vol. 26(2010) , pp.533-541.

DOI: 10.1016/j.future.2009.10.004

Google Scholar

[7] Li J Q, Pan Q K, Suganthan P N. A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem[J]. The International Journal of Advanced Manufacturing Technology Vol. 52(2011) , pp.683-697.

DOI: 10.1007/s00170-010-2743-y

Google Scholar

[8] De Giovanni L, Pezzella F. An improved genetic algorithm for the distributed and flexible job-shop scheduling problem[J]. European journal of operational research Vol. 200(2009) , pp.395-408.

DOI: 10.1016/j.ejor.2009.01.008

Google Scholar

[9] Lei D. A genetic algorithm for flexible job shop scheduling with fuzzy processing time[J]. International Journal of Production Research Vol. 48(2010) , pp.2995-3013.

DOI: 10.1080/00207540902814348

Google Scholar

[10] Ying Pan, Wei Sun, Xiao-Hong Lu, Qin-Yi Ma, An Adaptive Genetic Algorithm for the Flexible Job-shop Scheduling Problem[C], Proceedings 2011 IEEE International Conference on Computer Science and Automation Engineering (2011), pp.405-409.

DOI: 10.1109/csae.2011.5952878

Google Scholar