کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
496567 862864 2012 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity
چکیده انگلیسی

This paper proposes an effective discrete chemical-reaction optimization (DCRO) algorithm for solving the flexible job-shop scheduling problems with maintenance activity constraints. Three minimization objectives—the maximum completion time (makespan), the total workload of machines and the workload of the critical machine are considered simultaneously. In the proposed algorithm, each solution is represented by a chemical molecule. Four improved elementary reactions, i.e., on-wall ineffective collision, inter-molecular ineffective collision, decomposition, and synthesis, are developed. A well-designed crossover function is introduced in the inter-molecular collision, synthesis, and decomposition operators. Tabu search (TS) based local search is embedded in DCRO to perform exploitation process. In addition, the decoding mechanism considering the maintenance activity is presented. Several neighboring approaches are developed to improve the local search ability of the DCRO. The proposed algorithm is tested on sets of the well-known benchmark instances. Through the analysis of experimental results, the highly effective performance of the proposed DCRO algorithm is shown against the best performing algorithms from the literature.

An effective discrete chemical-reaction optimization (DCRO) algorithm is proposed for solving the flexible job-shop scheduling problems with maintenance activity constraints. Through the analysis of experimental results, the highly effective performance of the proposed DCRO algorithm is shown against the best performing algorithms from the literature. Comparison of the convergence curve for the average Pareto distance between DCRO and CRO for 15 × 10-m.Figure optionsDownload as PowerPoint slideHighlights
► We propose a discrete CRO algorithm for solving the FJSPs with PM constraints.
► We develop four improved elementary reactions for the DCRO algorithm.
► A well-designed crossover is introduced for the elementary reactions.
► Tabu search (TS) is embedded in DCRO to perform exploitation process.
► The effective performance of DCRO is shown against the best performing algorithms.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Soft Computing - Volume 12, Issue 9, September 2012, Pages 2896–2912
نویسندگان
, ,