The Job Shop Scheduling Problem (JSSP) consists of finding the best scheduling for a set of jobs that should be processed in a specific order using a set of machines. This problem belongs to the NP-hard class problems and has enormous industrial applicability. In the manufacturing area. decision-makers consider several criteria to elaborate their production schedules. https://parisnaturalfoodes.shop/product-category/peppermint-liq-castile-soap/