Solving Flexible Job‐Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net

Behnam Barzegar, Homayun Motameni and Hossein Bozorgi

Journal of Applied Mathematics, 2012, vol. 2012, issue 1

Abstract: Scheduled production system leads to avoiding stock accumulations, losses reduction, decreasing or even eliminating idol machines, and effort to better benefitting from machines for on time responding customer orders and supplying requested materials in suitable time. In flexible job‐shop scheduling production systems, we could reduce time and costs by transferring and delivering operations on existing machines, that is, among NP‐hard problems. The scheduling objective minimizes the maximal completion time of all the operations, which is denoted by Makespan. Different methods and algorithms have been presented for solving this problem. Having a reasonable scheduled production system has significant influence on improving effectiveness and attaining to organization goals. In this paper, new algorithm were proposed for flexible job‐shop scheduling problem systems (FJSSP‐GSPN) that is based on gravitational search algorithm (GSA). In the proposed method, the flexible job‐shop scheduling problem systems was modeled by color Petri net and CPN tool and then a scheduled job was programmed by GSA algorithm. The experimental results showed that the proposed method has reasonable performance in comparison with other algorithms.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2012/651310

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2012:y:2012:i:1:n:651310

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().