Hybrid Genetic Algorithm for Flexible Job Shop Scheduling with Overlapping in Operations

Abstract:

Flexible job shop scheduling problem )FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. FJSP is NP-hard and mainly presents two difficulties. The first one is to assign each operation to a machine out of a set of capable machines, and the second one deals with sequencing the assigned operations on the machines. However, it is quite difficult to achieve an optimal solution to this problem in medium and large size problems with traditional optimization approaches. In this paper a memetic algorithm )MA) for flexible job shop scheduling with overlapping in operation is proposed that solves the FJSP to minimize makespan time. The experimental results show that the proposed algorithm is capable to achieve the optimal solution for small size problems and near optimal solutions for medium and large size problems

• Periodical: Advanced Materials Research (Volumes 433-440)
• Pages: 1499-1505
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.433-440.1499
• Online since: January 2012
• Authors: Ali Rahimi Fard, Babak Yousefi Yegane, Narges Khanlarzade
• Keywords: Flexible Job Shop Scheduling, Hybrid Genetic Algorithm, Overlapping

References

This article has no references.