Research on reentrant job shop scheduling problems with infinite buffers

Job Shop Scheduling (JSP) and Flow Shop Scheduling (FSP) represent typical production scheduling problems. This paper delves into a JSP variant, Re-entrant Job Shop Scheduling (RJSP) with infinte buffers, introducing reentrance where certain jobs revisit machines at multiple steps. This paper devise a re-entrant job shop scheduling model with infinite buffers, aiming to minimize maximum completion time. Additionally, this paper propose an improve genetic algorithm for RJSP resolution, employing diverse initial solution generation methods and efficient crossover and mutation operators.