Multi Objective Flexible Jobshop Scheduling Problem using Heuristic Algorithm

Abstract

Flexible workshop problem (FJSP) is an extension of the classic job shop problem (JSP) that allows one operation that can be performed from a collection of alternative machines on a single machine. It is closer to the actual condition in manufacturing. Due to the additional conditions to assess the allocation of system operations, FJSP is more It's also a typical problem in combinatorial optimization. But the difference is that all the workers in the shop floor may or may not be handled in all the computers. In just one machine or two machines, a job can be processed or a separate task in all machines may have to go through the processing in order to be finished. Each computer has different work sequences. So it's an internet str complex. The classical workshop scheduling problem varies from the problem of the flow shop and the work flow is not unidirectional. It is more complex than JSP, combining all JSP's problems and complexities. All workers have the same operations series. In this field, in the objective of minimizing "make period time" and mean flow time, the problem is considered with bi-criteria.. nitially manual calculation is done with the question of literature and then with the method of Gantt chart for collecting industrial data.