heuristics


1
This article will describe one (of possible many) solutions for solving the Fisher & Thompson Job Shop Scheduling Problem. I will use the FT10 data set, which consists of 10 machines 10 jobs with 10 steps each Each job consists of many steps, that need to be processed in a […]

Solving Fisher Thompson FT10 with Optaplanner