PROPOSING NEW CDS ALGORITHMS UTILIZING CRYPTOGRAPHIC METHODS

The Campbell Dudek smith (CDS) algorithm was used to schedule the manufacturing process, with makespan optimization in mind, to create 12-inch pan goods, 14-inch griddle products, 16-inch griddle products, 18-inch griddle products, and 20-inch griddle products. The Campbell, Dudek, and Smith (CDS) algorithm is a flow shop TABLE-type scheduling approach that can reduce make span 2 machines in a series configuration by adapting Johnson's rule. The work results in a program that can autonomously plan the manufacturing of things by the machine. The testing revealed that a work order of 20 grids, 18 grids, 16 grids, and 12 grids resulted in a minimum makespan value of 210.12 minutes, assuming a total production of 12 pieces across all products with 6 repeats. Testing the application's accuracy revealed a rate of 99.99% the first time and 99.96% the second when compared to hand-computed values.