Journal of Advanced Computational Intelligence and Intelligent Informatics
Online ISSN : 1883-8014
Print ISSN : 1343-0130
ISSN-L : 1883-8014
Regular Papers
Priority Rule-Based Construction Procedure Combined with Genetic Algorithm for Flexible Job-Shop Scheduling Problem
Soichiro YokoyamaHiroyuki IizukaMasahito Yamamoto
Author information
JOURNAL OPEN ACCESS

2015 Volume 19 Issue 6 Pages 892-899

Details
Abstract

The heuristic method we propose solves the flexible job-shop scheduling problem (FJSP) using a solution construction procedure with priority rules. FJSP is more complex than classical scheduling problems in that operations are processed on one of multiple candidate machines, one of which must be selected to get a feasible solution. The solution construction procedure with priority rules is implemented on top of the efficient existing method for solving the FJSP which consists of a genetic algorithm and a local search method. The performance of the proposed method is analyzed using various benchmark problems and it is confirmed that our proposed method outperforms the existing method on problems with particular conditions. The conditions are further investigated by applying the proposed method on newly created benchmark.

Content from these authors

This article cannot obtain the latest cited-by information.

© 2015 Fuji Technology Press Ltd.

This article is licensed under a Creative Commons [Attribution-NoDerivatives 4.0 International] license (https://creativecommons.org/licenses/by-nd/4.0/).
The journal is fully Open Access under Creative Commons licenses and all articles are free to access at JACIII Official Site.
https://www.fujipress.jp/jaciii/jc-about/
Previous article Next article
feedback
Top