Flexible Job Shop Scheduling Problem (FJSP)

This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique has been used widely to the reduce completion time of a production system. With respect to the complexity of the problem, optimization techniques such as branch and bound methods are no so efficient at medium and large dimensions; thus, to solve the problem, metaheuristic techniques are good option. In this study, first of all, the problems are solved in both permitted and not permitted of lot streaming by means of memetic algorithm and then by using the critical path method heuristic, we obtain better results. The numerical
Planning of operations is proposed to optimize one or more criteria as target function.
Flexible Job shop Scheduling Problem (FJSP) includes two major sub-problems as follows: Allocation sub-problem that deals with dedicating any operation to a machine among possible machineries; Scheduling sub-problem in which sequence of operation over machineries is
In hierarchical approach, the problem is converted into two sub-problems: Allocation problem and scheduling problem [2]. This separation will reduce complexity; nevertheless, the obtained results are also far from the optimal solutions. In integrated approach, allocation and scheduling are done simultaneously; also, compared to hierarchical method, in this approach better answers will result and also the necessary time for acquiring the solutions is longer. In the following, initially we review on some of the conducted studies with hierarchical approach and then, we will explore the conducted studies with integrated