Processing time tolerance-based ACO algorithm for solving job-shop scheduling problem

• Published in: IOP conference series. Earth and environmental science Vol. 69; no. 1; pp. 12181 - 12186
• Main Authors: Luo, Yabo, Waden, Yongo P
• Format: Journal Article
• Language: English
• Published: Bristol IOP Publishing 01.06.2017
• Subjects: Algorithms; Ant colony optimization; Constraint modelling; Job shop scheduling; Job shops; Optimization; Reliability; Tactics
• ISSN: 1755-1307; 1755-1315; 1755-1315
• DOI: 10.1088/1755-1315/69/1/012181

Ordinarily, Job Shop Scheduling Problem (JSSP) is known as NP-hard problem which has uncertainty and complexity that cannot be handled by a linear method. Thus, currently studies on JSSP are concentrated mainly on applying different methods of improving the heuristics for optimizing the JSSP. However, there still exist many problems for efficient optimization in the JSSP, namely, low efficiency and poor reliability, which can easily trap the optimization process of JSSP into local optima. Therefore, to solve this problem, a study on Ant Colony Optimization (ACO) algorithm combined with constraint handling tactics is carried out in this paper. Further, the problem is subdivided into three parts: (1) Analysis of processing time tolerance-based constraint features in the JSSP which is performed by the constraint satisfying model; (2) Satisfying the constraints by considering the consistency technology and the constraint spreading algorithm in order to improve the performance of ACO algorithm. Hence, the JSSP model based on the improved ACO algorithm is constructed; (3) The effectiveness of the proposed method based on reliability and efficiency is shown through comparative experiments which are performed on benchmark problems. Consequently, the results obtained by the proposed method are better, and the applied technique can be used in optimizing JSSP.