Finally, the model we propose is an extension of the flow shop scheduling problem that identifies a sequence of (bales) jobs processed that minimizes makespan [1]}, [2]}, [3]}, [4]}, [5]}. The order of operations is the same for all (bales) jobs, but the processing time of each (bale) job in each operation differs based on the characteristics of the (bale) job. In our model, we group bales based on moisture level (low, medium, high) and carbohydrate content (\(< 59.1\%\)  or \(\ge 59.1\%\) ). Since this grouping leads to only a few different types of bales, we evaluate sequences numerically.
