APPLYING AN ADAPTIVE PETRI NET TO CALCULATE THE MAKESPAN IN THE JOB SHOP SCHEDULING PROBLEM

The Job Shop Scheduling Problem (JSSP) is one of thetypical problems that engineers face on designingFlexible Manufacturing Systems (FMS). In thisproblem, it is important to find the optimal schedulingto perform a set of tasks in the minimum time.Moreover, the JSSP has some restrictions, such as thetasks order and the number of shared resources wherethe tasks are carried out. To find the optimal taskssequence it is necessary to obtain the makespan for eachsequence. On this way, FMS can be modeled with Petrinets (PNs), which are a powerful tool that have beenused to model and analyze discrete event systems. So,the JSSP can be analyzed in a PN representation of theFMS, and the makespan can be calculated by using thePN model. In this work we propose an adaptive PN toobtain the makespan by applying PN analytical tools.