4 machines and 9 jobs
Jobj | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
Pj | 4 | 9 | 3 | 3 | 6 | 8 | 8 | 12 | 6 |
Determine a schedule that minimizes the makespan of the following jobs on 3 machines.
a) Compute Cmax(LPT)
b) Pair the jobs 1-5, 2-6, 4-5, 7-8-9
• What is Cmax?
• Is this Cmax(OPT)? Why?
c) What is Cmax(LPT)/Cmax(OPT) ?
Answer: (a) Cmax(LPT) = 21
(b) Cmax = 26, Cmax OPT = 20
(C) Cmax LPT/Cmax OPT = 21/20
Explanation:
a). When computing Cmax LPT, Assign the jobs with Longest Processing Time to the machines first. This is how the assignment looks like in this case
The Cmax would be the Max of the processing time that any Machine is taking, which is
21
(b) As per given information assignment of jobs:
Cmax is coming out to be 26
Is this Cmax OPT? Let's compute that to comment on this.
Total Processing time is the sum of process times of all jobs.
Load per machine = Total Process Time / Total Machines = 20 ( Rounded up)
Assigning jobs keeping in mind the load per machine
Cmax OPT = 20
Which is the optimal assignment of jobs, and it is line with loads per machine.
(c). Ratio Cmax LPT/Cmax OPT = 21/20
9. Let f be the following permutation in the symmetric group S9, written in two-line notation. 1 2 3 4 5 6 7 8 9 5 9 4 8 2 6 1 3 7 (a) Determine f3121 and explain why your answer is correct. (b) Determine ord(f) (c) Find a permutation p such that p-f 9. Let f be the following permutation in the symmetric group S9, written in two-line notation. 1 2 3 4 5 6 7 8 9...
***(unable to provide data except by using pictures) .2 6 9 3 8 3 2 1 5 5 4 9 9 9 4 5 7 5 4 7 82445538955922245 5 3 4 3 2 5 3 2 4 3 2 2 4 3 2 3 2 2 2 1 2 2 4 2 2 2 1 3 3 3 12 233 7 8 2 8 3 1 12111 2-21 1 382015785685 7 599231958 0 2 2 5 782 2990957503 1...
Python Question: In [76]: arr3d = np.array([[[1, 2, 3], [4, 5, 6]], [[7, 8, 9], [10, 11, 12]]]) In [77]: arr3d Out[77]: array([[[ 1, 2, 3], [ 4, 5, 6]], [[ 7, 8, 9], [10, 11, 12]]]) In [78]: arr3d[0] Out[78]: array([[1, 2, 3], [4, 5, 6]]) Can someone tell me why arr3d[0] is a 2 × 3 array?
398753847300 7 8 8 3 7 5 8 9 5 1 8 1 9 1 3 1 1 9 4 5 3 1 1 5 7 9 583211 120011120 222221102020112111212 302012213 993221514200 4 7 5 5 2 9 1 6 7 3 3 8 4 9 2 1 6 3 5 7 9 6 1 4 7 4 632286 646204842 41343282 56565555 33282524983465454919 65556566446655656465 6 5 565656556 28443321146216537572767174791778729ー8363526 64907 8786 8 3. 1 4 3 3 8 5 4 8...
Iy uaIdii u CIOW iiIA CADIessions. (1) 1+2*3+ (4*5+6) 7 (2) 1+2*3+ ((4*5+6) 7) (1+2 3)+(4*5+6) 7 ((1)+(2+3)) + ( (4*5+6) *7)) (5) 1+2 3+ ((4*5+6) 7 (6) 1+2 3+ (4*5+6) *7) (7) 1++2 3+ ( (4*5+6) 7) (8) 1+2*3+ ((4*5+6) 7+) (9) 1+2*3+ ( (4 5+6) *7)+ (10) 1+2 3+(9 (4*5+6) 7) (11) 1+2*3+ ( (4*5+6) 7)9 (3) 5. What are the postfix expressions of (1) (4)? Do they have the same expression? If they do not, please explain...
8 α = (д 1 9 2 5 3 4 5 10 3 6 7 86 9 10 2 7 10) 1 4 1 в = (1, 2 3 3 5 4 8 5 2 6 9 7 7 8 4 9 6 10 1 10) 10 8 ү 1 3 2 7 3 9 4 5 1 5 6 7 8 2 9 4 19) 10 1 ө ( 42 2 4 5 4 6 5 2 6 7...
(1) Write the permutation 1 2 3 4 5 6 7 8 9 10 7 5 10 3 8 9 6 2 4 ( 10 1 as a product of disjoint cycles.
Write a C program that reads a simple data file such as, text.txt 3 2 //This first row indicates the number of jobs and the number of machines 0 5 1 10 //These other row represents a specific job combined by (machine-id, job-duration) pairs. 0 10 1 5 0 1 1 4 After that randomly initialize a genetic algorithm population (say population size = 100) and compute the makespans of the population. Select the best schedule according to makespans and...
Figure 1 1 price Sattert 9 8 7 s 6 5 4 3 2 1 2 4 6 8 10 12 14 16 qaoxtity Refer to Figure 1. When there is a per-unit tax of $3 imposed on the cigarette, in this case, what is the price that buyers actually pay and what is the price that sellers actually receive? Select one: a. $3, $6. b. $4, $6. c. $6, $3. d. $5, $3.
Compute the sign of the following permutations: (a) (1, 4, 3, 6, 7)(5, 8, 9, 10). (b) σ ∈ Sn, i 7→ n + 1 − i. (c) Show that this initial configuration of the 15 puzzle is not solvable 3 1 15 13 2 8 5 9 12 7 11 4 14 6 10 − (d) Suppose that (i, j) ∈ Sn is a transposition and that i < j. Find an expression (in terms of i and j...