Study on an Advancement to Genetic Algorithm for Flexible Job-Shop Scheduling with Overlapping in Operations

Flexible job-shop scheduling is a type of scheduling which is extension of Job-shop scheduling problem. In FJSP, operations are processed on different machines, which means operations are break down to sublots, and these sublots are processed by machines independently. In previous research, a mathematical model was developed along with implementation of Genetic Algorithm. This paper gives an overview of improved methods to Flexible Job-Shop scheduling Problem with overlapping in operation[1].