On Optimization of Batch Process of Job-shop Scheduling

The job shop scheduling problem has been studied for decades and known as NP hard problem. The flexible job shop scheduling problem is an extension of the classical job scheduling problem that allows one operation to be processed on several machines out of a set of machines. The problem is to assign each operation to a machine and find a sequence for the operations on the machine in order that the completion time of all operations is minimized. A new encoding scheme for batch process schedule is presented. Several batch process scheduling schemes are analyzed. Finally, the results of these schemes are shown and it is confirmed that the optimum schedule of general scheduling is not fitted for batch process scheduling.