Approach for Multi-Objective Flexible Job Shop Scheduling

Article Preview

Abstract:

A multi-objective scheduling method based on the controlled Petri net and GA is proposed to the flexible job shop scheduling problem (FJSP). Function objectives of the proposed method are to minimize the completion time and the total expense and workload of machines. Firstly, a Parikh vector based approach for Petri net controller is introduced, and based on this method, the Petri net model is constructed for FSP with machine breaking down. Then, the genetic algorithm (GA) is applied based on the controlled Petri net model and Pareto. Finally, simulation results based on an example show that the method is efficient.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 542-543)

Pages:

407-410

Citation:

Online since:

June 2012

Authors:

Export:

Price:

[1] T. Pasupathy, Chandrasekharan Rajendran, and R. K. Sure, A multi-objective genetic algorithm for scheduling in fowshops to minimize the makespan and total flow time of jobs, The International Journal of Advanced Manufacturing Technology. 27 (2006).

DOI: 10.1007/s00170-004-2249-6

Google Scholar

[2] Frantisek C, Solving a multi-objective no-wait flow shop scheduling problem with an immune algorithm, The International Journal of Advanced Manufacturing Technology. 36 (2008) 969-981.

DOI: 10.1007/s00170-006-0906-7

Google Scholar

[3] R. K. Suresh, K. M. Mohanasundara, Pareto archived simulated annealing for job shop scheduling with multi-objective, The International Journal of Advanced Manufacturing Technology. 29 (2006) 184-196.

DOI: 10.1007/s00170-004-2492-x

Google Scholar

[4] Cui Xunxue, Multiobjective Evolutionary Algorithms and their Applications, Beijing: National Defense Industry Press, (2006).

Google Scholar

[5] Hao D, Jiang C J, and Lin L, Petri Net Based Modeling and GA Based Scheduling for FMS, Chinese Journal of Computers, 28 (2005) 201-208.

Google Scholar

[6] H.J. Hung, and T.P. Lu, Solving a multi-objective flexible job shop scheduling problem with timed Petri nets and genetic algorithm, Discrete Mathematics, 2 (2010) 221-237.

DOI: 10.1142/s1793830910000607

Google Scholar