The comparison of optimum heuristic and deterministic scheduling rules for job shop scheduling in the manufacture

Abstract

There are some types of scheduling problems in the production line of manufacturing. One of the most multiple usages of the operational machine for doing some jobs is job shop scheduling. The implementation of the job shop problem in this study uses the input of random order of eight job numbers. The raw materials for the job numbers to do the process and the five type machines are considered. The machines work in different functions to do the jobs for some materials. The materials have processed the work in process (WIP) before they are sent to the warehouse. The proposed of this study is to find the optimal condition of job shop scheduling heuristic and deterministic rules to minimize the makespan, tardiness with the heuristic and some deterministic rules in the Lekin software. The heuristic methods are General SBRoutine and the DASH (shifting bottleneck). The deterministic use Critical Ratio (CR) Rule, First come First Serve Rule (FCFS), Longest Processing Time (LPT), Shortest Processing Time (SPT), Weighted Shortest Processing Time (WSPT) and Machine Sequence (MS). The result shows that the minimum makespan is FCFS method with 47 minutes, the tardiness is 27, and for the machine no3. It produces the effective percentage of The contras deviation performance among the jobs of DASH, and compare to the FCFS is as follow, DASH, LPT, MS, SPT, WSPT are increasing 4.26%; 31,91%; 8.51%; 4.26% and 12.77% respectively.