Schedulling….

1.Consider the following data for a single machine scheduling
problem:

Jobs 1 2 3 4 5 6 7

pj 16 18 22 15 12 7 10

wj 1 5 2 4 1 4 2

dj 28 30 44 24 90 85 100

Please, solve the instance by using LEKIN under the following
rules and print screen of the comparison chart for varius
objectives and state your comments under it.

(a) EDD

(b) SPT

(c) WSPT

(d) LPT

(e) CR 2.

2- Consider the following data for a Flow shop problem:

Jobs 1 2

p1j 5 2

p2j 4 4

p3j 6 3

p4j 3 5

Use LEKIN to determine how two jobs should be scheduled in order
to minimize the total makespan.

3 – Consider 6 machibnes in parallel and 13 jobs. The pocessing
imes of the 13 jobs are tabulated below:

Jobs 1 2 3 4 5 6 7 8 9 10 11 12 13

pj 6 6 6 7 7 8 8 9 9 10 10 11 11

a. Compute the makespan under Longest Processing Time (LPT)
rule: For each time a machine is freed, select the job (among those
immediately available for processing on the machine) with LPT and
schedule.

b. Find to optimal schedule in order to minimize makespan.
Please verify your answer.