Research of Multi-Objective Optimization Study for Job Shop Scheduling Problem Based on Grey Ant Colony Algorithm

2011 ◽  
Vol 308-310 ◽  
pp. 1033-1036 ◽  
Author(s):  
Ya Dong Fang ◽  
Fang Wang ◽  
Hui Wang

In order to resolve Multi-objective job shop scheduling problem, an optimization method of many goals scheduling based on grey relation theory and ant colony algorithm is proposed. Firstly, this paper introduces the relevant mathematical theory. AHP and Grey relational analysis, and they are combined to solve the choice of pre-processing equipment under the multi-objective conditions. What's more, ant colony algorithm is discussed to solve problem of processing order for machine. The effectiveness of multi-objective algorithm for job shop scheduling problem is verified through applying example.

2011 ◽  
Vol 411 ◽  
pp. 407-410
Author(s):  
Yan Cao ◽  
Lei Lei ◽  
Ya Dong Fang

Production sequence of workpieces on machines, also called job-shop scheduling problem (JSP), is a focus both in academics and in practices. The research on the problem can promote theoretical progress, shorten the production cycles, improve efficiency in using resources, and strengthen market response in actual production. Ant colony optimization (ACO) is very suitable for the solving of the problem. In the paper, a disjunctive graph model of JSP is set up, which transforms the problem into a natural expression that is suitable for ACO. Then, realization steps of ACO for JSP are discussed. Finally, a 3×3 JSP problem is solved in Jbuilder X. The obtained optimal solution verifies the feasibility and effectiveness of ACO in solving JSP.


Sign in / Sign up

Export Citation Format

Share Document