Heuristic Methods for Job Shop Scheduling

As a result there are still some schedules that are not precise causing a large make-span. In observations made on 5 products the company requires a total production time (make-span) of 11 hours 54 minutes in completing production activities. In this research scheduling evaluation is conducted to minimize make-span using the Active Schedule Generation algorithm Non-delay Schedule Generation and Heuristic Schedule Generation Algorithm The approach used is to use a quantitative-comparative approach namely research that compiles the calculation process to make comparisons between the results of the actual process with these methods. Therefore the Heuristic Schedule Generation algorithm method was chosen as the best method and can be applied in the company to minimize the make-span.