7 6
2  1  0  3  1  6  3  7  5  3  4  6
1  8  2  5  4 10  5 10  0 10  3  4
2  5  3  4  5  8  0  9  1  1  4  7
1  5  0  5  2  5  3  3  4  8  5  9
2  9  1  3  4  5  5  4  0  3  3  1
1  3  3  3  5  9  0 10  4  4  2  1
2  4  4  4  0  2  3  7  5  2  1  3
//
// a 7 by 6 jobshop problem
// each row (there are 7) is a job
// each job has 6 operations (a machine/duration pair)
// each operation requires
//  -  a machine (0 to 5)
//  -  a duration on that machine (1 to 10)
//
// The problem is to find the shortest makespan
// were makespan is the time required to complete all jobs.
//
// minimum makespan is 57
//