An Artificial Bee Colony Approach for Multi-objective Job Shop Scheduling

详细信息    查看全文

• 作者：Abyson Scaria^a ; Kiran George^b ; Jobin Sebastian^a ; ^{jseb93@gmail.com" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Job Shop Scheduling Problem (JSSP) ; Artificial Bee Colony (ABC) ; Makespan ; Tardiness.
• 刊名：Procedia Technology
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：25
• 期：Complete
• 页码：1030-1037
• 全文大小：222 K

文摘

Scheduling is the proper allocation of resources over a period for performing a set of tasks with the objective of optimizing one or more performance measures. The actual assignment of starting and completion times of operations on jobs, if the manufacturing order is to be completed on time is known as Production scheduling. The Job Shop Scheduling Problem (JSSP) is one of the most difficult scheduling problems. Since JSSP is NP-complete, that is, the selection of the best scheduling solution is not polynomially bounded, heuristic approaches are often considered. This is an important practical problem in the field of production management and combinatorial optimization. Inspired by the decision-making capability of bee swarms in the nature, this paper proposes an efficient scheduling method based on Artificial Bee Colony (ABC) for solving the JSSP. Most of the researchers in production scheduling are concerned with the optimization of a single criterion. However, the performance of a schedule often involves more than one aspect and, therefore requires a multi-objective treatment. Minimization of makespan and total tardiness are the two performance measures considered in this paper. The Artificial Bee Colony algorithm was coded in MATLAB 2009. A parameter analysis was done to fix the control parameters of Artificial Bee Colony algorithm. The performance of the algorithm was analyzed on the benchmark problems provided by E. Taillard.