Job Shop Scheduling Problem Modelling using Petri Net for making the Application of Scheduling Production Simulation.

Abstract

The problems and challenges in the production process are how to manage the available machines and human resources optimally. In fact, many industries are not optimal in the production process due to unclear scheduling. As a solution, a production scheduling management is required to optimize scheduling using simulation. To create the scheduling simulation, it is necessary to notice workflow and obstacle that exist in the production system. Petri Net can be used to model the overall manufacturing process flow , to map the resource and to indicate potential conflicts in the production system. Four  priority rule s used in this production scheduling simulation to determine the most optimal results are FCFS, SPT, LPT and EDD. In this research, bread production process was modeled using 6 types of job and 9 process with the dynamic arrival time order. From the scheduling simulation FCFS has better results on the criterias of makespan, number of tardy jobs, mean tardiness and max tardiness while SPT is better on the mean flowtime criteria. Because the arrival orders time are not the same (dynamic), the rule s other than FCFS requires sorting process that led to the delay before the execution process.