Heuristic methods for job shop scheduling: Active schedule generation algorithm, non-delay schedule generation algorithm and heuristic schedule generation algorithm

PT. Multi Citra Busana is one of the knitting material convection companies that has a good local scale marketing area where production scheduling is usually done based on the order of arrival of orders or first come first serve (FCFS). 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. Through the Active Schedule Generation algorithm method, the value of make-span is 6 hours 26 minutes. Through the Non-delay Schedule Generation algorithm method, the value of make-span is 7 hours 1 minute. The Heuristic Schedule Generation algorithm method produces the smallest make-span value with a value of 6 hours 1 minute. Based on the comparison of the make-span values of the three methods used, it was concluded that the Heuristic Schedule Generation algorithm produced the smallest make-span valued at 20184.27 seconds or 6 hours 3 minutes shorter than the method applied by the company. 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.