Job Shop Alike Problem Sorting Algorithm

Right now I'm working with job shop alike task with the use of a genetic algorithm. Each job consists of one operation, which is a timeseries variable. I've finished the task of minimizing the makespan.

The output of the GA solution is a vector of machine indexes to which each job is specified. Each job is consists of one operation and can be flexibly rearranged in the schedule.

Example of resulting machine # 1 vector:

The help I'm looking for is how to sort the timeseries in each machine vector, that sum of all machine vectors would be minimal.

The schedule is saved as an index of a machine, that corresponds index of timeseries. For example:

machineSchedule = [1 3 2 5 6 2 6 3 5 4 1 6]; % index of machine that assigned to the job
jobIndex = [1 1 1 2 2 2 2 2 2 3 3 3]; % index of timeseries variable

And so on.