Journal
INTERNATIONAL JOURNAL OF SIMULATION MODELLING
Volume 16, Issue 3, Pages 497-505Publisher
DAAAM INTERNATIONAL VIENNA
DOI: 10.2507/IJSIMM16(3)CO11
Keywords
Flexible Job-Shop Scheduling Problem (FJSP); Multi-Objective Optimization; Hybrid Ant Colony Algorithm
Funding
- Zhejiang Provincial Natural Science Foundation of China research program [LQ15G020006]
- Philosophy and Social Science Plan of Zhejiang Province [[2015], 7]
Ask authors/readers for more resources
For an enterprise to survive the fierce market competition, efficient production scheduling is a must as it improves economic efficiency and reduces cost. As an important branch of production scheduling, the flexible job-shop scheduling problem (FJSP) is a mixed blessing. It accurately reflects the characteristics of the actual production, but adds to the difficulties in problem solving. With the ant colony algorithm as the basic optimization method, this paper proposes the hybrid ant colony algorithm based on the 3D disjunctive graph model by combining the elitist ant system, max-min ant system and the staged parameter control mechanism, optimizes the FJSP problem to minimize the longest completion time, the early/delay penalty cost, the average idle time of the machine, and the production cost, and verifies the effectiveness of the model and algorithm by an example. (Received, processed and accepted by the Chinese Representative Office.)
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available