Track: Mathematical Modeling/ Heuristics and Meta-heuristics

Abstract

The previous research applied the Artificial Immune System Algorithm in job shop scheduling with five jobs and three machines with a makespan result of 61.15 time-units. The algorithm is considered inaccurate because it requires complicated steps for operators to understand, such as determining random numbers of initialization and clones, donor seeds, and repetition of gene fragments to produce a smaller makespan. The proposed algorithm is derived from the Non-delay Algorithm with a modification in the form of ranking based on the criteria of the earliest start time, the earliest finish time, the longest remaining total processing time, and the total remaining operations. Modifications are also made by giving the priority order of machines based on the most used machines in each operation. The results showed that the proposed algorithm could shorten makespan by 3.99% to 57.16 time-units with a reliability percentage of 55.55%. The proposed algorithm gave the same or better results in the first ten cases with two to six jobs. The small number of jobs and machines resulting in a small combination of scheduling sequences and cases that might be resolved optimally on the reference data. The proposed algorithm could not give a shorter makespan result in the eleventh to eighteenth cases with more than six jobs. The proposed algorithm only provided one scheduling sequence, with the advantage of being a few easy steps.