$(50$ pts$)$

Construct your own $J7||C_{\text{m}\text{a}\text{x}}$ problem such that:

There are $5$ jobs to be processed.

There are $7$ machines in the job shop environment.

Create your own machine routing for all jobs. Make sure that only only $2$ jobs out of $5$ jobs require M$1$; only $2$ jobs out of $5$ jobs require M$2$ ; only $3$ jobs out of $5$ jobs require M$3$; only $1$ job out of $5$ jobs requires M$4$; only $4$ jobs out of $5$ jobs require M$5$; only $2$ jobs out of $5$ jobs require M$6$; only $1$ job out of $5$ jobs requires M$7.($Select the jobs arbitrarily for each machine. Make sure that all $5$ jobs are used in the setting. That is$,$ each job must be processed by at least one machine$).$

Select a different integer processing time for each job on the processed machines from the interval: $1,20$ minutes. You can see an example in the table below $($just a feasible problem setting out of a set of potential problem settings$).$ Do not try to solve this problem! Do not use the same machine routing for the jobs! Make up vour own machine routing for all jobs, based on the underlined conditions above. $($Note: $p_{ij}$ represents the processing time of job $j$ on machine $i)$

$\backslash$table$[[$Job$,$Machine Sequence,Processing Times$],[1,$M$5,p_{51}=5$