Use graphical method to minimise the time added to process the following jobs on the machines shown:
| Job 1: | Sequence | A | B | C | D | E | |||||||||||||||||
| Time | 3 | 4 | 2 | 6 | 2 | ||||||||||||||||||
| Job 2: | Sequence | B | C | A | D | E | |||||||||||||||||
| Time | 5 | 4 | 3 | 2 | 6 | ||||||||||||||||||
Calculate the total time elapsed to complete both the jobs
To solve this problem numerically using a graphical method (Gantt chart), we need to schedule the jobs on machines while considering their sequences and processing times. The objective is to minimize the total time taken. --- ### Step 1: Understanding the Data We have two jobs (Job 1 and Job 2), each with a defined sequence of machines (A, B, C, D, E) ______ ___ _______ ___ ___.
_____ _______ ____ __________ __________ ______ _________ ________ ___.
_________ ________ ______ __________ _____ ___ ______ _________ _____ ______ ___ ___.
__________ ______ _______ ______ _______ _______ _________.
________ ____ __________ ___ __________ _______ _________ ________ _________.
__________ _________ ___ _______ _____ _________.
______ ____ _______ _________ ____ _____ ___ ____.
______ __________ _______ ________ __________ ____ ___ ________ _________ ________ ____ ______.
____ _____ _____ _______ __________ ____ ____ __________.
_____ ______ _________ ______ ____ ________ _____ ____.
_______ __________ ________ _____ ______ ____ ___ ___.
__________ ______ _________ __________ ____ ______ ____ ________ ____.
_________ _____ ____ _______ _________ ________ ________ _______ _______.
_________ _________ ______ _______ ________ ________.
_____ ___ _________ _____ ______ _________.
___ ________ _____ _________ ________ ______ _____ ______ ___ ____.
______ _________ ________ ____ ______ ____ _________ __________ _________ ____ ________.
________ _________ ___ ___ _________ ____ ________ _________ ______.
__________ ____ _______ __________ _______ __________ ______ ________ ___ _______.
_______ ___ _______ _____ _____ ___ _______ ____.
_________ ______ ___ _______ ___ __________ ___ _________ ___ ____ _________.
_________ _________ ________ _________ _____ ______ ________ ____ ________ _________ _______ ___.
__________ _________ _______ ____ ______ ________ ____ _____ ___ _______.
_________ ___ ___ ________ ____ ____.
_____ ____ __________ ___ ________ __________ _________ _____.
_________ ________ __________ ____ ___ ___ __________.
_____ _________ _____ ___ ______.
____ _____ _________ ____ _____ __________ _______.
_______ __________ ____ _____ ____ _________ ____ __________ __________ __________.
____ _______ ________ ____ _______ ______ ____ ______.
_______ ____ _____ __________ _______ _________.
____ ____ _______ _____ _______.
__________ _____ _________ _________ ___ _________ _____ _____ __________ _________.
__________ _______ _____ _______ ______ _______ ________ ______.
_______ __________ ________ _________ _________ _____ ________.
______ _________ ____ _______ _________ ____ ______.
_________ ____ _____ _______ ________ ________ _____ _____ _________ __________ __________ _____.
_______ _____ ________ ________ _________.
___.
Get Full Answer on WhatsApp
Rewrite the following linear programming problem in Standard form:
Minimise
Subject to the Constraints:
Solve the following LPP using graphical method:
Maximize
Subject to the Constraints:
Use graphical method to minimise the time added to process the following jobs on the machines shown:
| Job 1: | Sequence | A | B | C | D | E | |||||||||||||||||
| Time | 3 | 4 | 2 | 6 | 2 | ||||||||||||||||||
| Job 2: | Sequence | B | C | A | D | E | |||||||||||||||||
| Time | 5 | 4 | 3 | 2 | 6 | ||||||||||||||||||
The following data comprising the number of customers (in hundred) and monthly sales (in thousand Rupees):
| Number of Customers (in hundred) | 4 | 6 | 6 | 8 | 10 | 14 | 18 | 20 | 22 | 26 | 28 | 30 | ||||||||||
| Monthly Sales (in thousand Rs) | 1.8 | 3.5 | 5.8 | 7.8 | 8.7 | 9.8 | 10.7 | 11.5 | 12.9 | 13.6 | 14.2 | 15 | ||||||||||
Solve the following LPP using Simplex method:
Maximize
Subject to the Constraints:
State whether the following statements are True or False and also give the reason in support of your answer.
a) The Set $ ={(x, y) : 0 ≤ y ≤ 5 when 0 ≤ x≤ 2 and 3≤ y≤ 5 when 2≤ x ≤ 7 } is not a convex set.
b) If 10 is added to each of the entries of the cost matrix of a 3 x 3 assignment problem, then the total cost of an optimal assignment for the changed cost matrix will increase by 10.
c) The solution to a transportation problem with m-rows (supplies) and n-columns
(destinations) is feasible if number of positive allocations is m + n.
d) The Value di ≥ 3 indicates an outlying observation in regression analysis.
e) Variations which occur due to natural forces and operate in a regular and periodic manner over a span of less than or equal to one year are termed as cyclic variations.
A department head has four subordinates, and four tasks to be performed. The subordinates differ in efficiency, and the tasks differ in their intrinsic difficulty. His estimate, of the time each man would take to perform each task, is given in the table below:
| Tasks | Subordinates | ||||||||||||||||||
| E | F | G | H | ||||||||||||||||
| A | 18 | 26 | 17 | 11 | |||||||||||||||
| B | 13 | 28 | 14 | 26 | |||||||||||||||
| C | 38 | 19 | 18 | 15 | |||||||||||||||
| D | 19 | 26 | 24 | 10 | |||||||||||||||