Question
Using the graphical method to minimise the time required to process Job 1 and Job 2 on five machines A, B, C, D and E, find the minimum elapsed times an idle times to complete both jobs.
| Job 1 | Sequence | A | B | C | D | E | |||
| Time (in hours) | 1 | 2 | 3 | 5 | 4 | ||||
| Job 2 | Sequence | C | A | D | E | B | |||
| Time (in hours) | 3 | 4 | 2 | 1 | 5 | ||||
Answer :
Word Count : 473
To solve this problem using the graphical method (also known as the two-machine flow shop scheduling method), we need to minimize the total elapsed time for completing both Job 1 and Job 2 across five machines. ### Step 1: Organize Data We have the following data for Job 1 and Job 2: #### Job 1: | Machine | Sequence | Time (hours) | |---------|----------|--------------| | A | 1 | 1 | | B | 2 | 2 | _______ _________ _________ _______ _______.
_______ _______ ______ _______ _______ _____ _______ _____ ___ ____.
_______ _________ _________ ____ ________ ___ _______ _______ ____ _________ _________.
____ _____ _____ ____ __________ ____ ________ _______.
________ _______ _______ _______ __________.
___ ________ __________ ___ ________ ____ ____.
_________ _______ __________ _________ ___ _______ __________ _______ ___ _____ ___.
_______ ______ _______ __________ _____ ____ ___ __________ ______ ___ ______ __________.
________ ______ ________ __________ ____ ____.
_______ _______ _________ __________ ____ __________.
________ _____ ___ _______ ______ ____.
_____ ___ __________ _______ ____ _________ __________ _____ _____ ________ _____ ______.
_______ __________ ___ _____ ______ _________ _______ _______ ____ ______ _________.
_______ ________ __________ ______ _____ _______ _____ ________ _________ __________.
______ ____ ___ ________ __________ ________.
____ ______ ____ ____ _______ _____ ________ _____.
______ _________ ______ __________ ___ ____.
__________ _________ ________ _________ __________ _______ ___ ________ ________ _________ _________.
____ _____ ________ __________ _____ ________ ______ __________ __________ __________.
_________ ________ ___ ___ _________ _____ ___ ______ ____ ____ _____ _____.
_______ ___ __________ __________ ______ _________ _______ ___ ______.
_____ _______ __________ _________ ________ __________.
____ ________ __________ ___ ________ ______ _____ ____.
_____ ___ _____ __________ __________ _________ _________ ______ _______ _______ ___.
____ ________ ___ __________ ____ __________ ____ _______ _________ _____.
_______ _____ ______ __________ ________ _______ _________ ___ __________.
___ _____ _____ ___ ________ _____ ________ ___ _______ ______ ___ _____.
_______ ____ _______ _____ ___ _________ _____.
______ ________ _________ __________ ______ ______.
_______ _________ ____ ____ _______ _________ ________.
_________ _________ _____ ______ _____ ____ ____ ______ ___ ____.
_____ _________ ____ ______ ____ __________ __________ _____.
______ ________ _______ __________ _______ ____ ________ __________ _____ ______ _______.
________ ______ _________ __________ ___ _______ _________ ________ ____ ________.
____ ___ ____ __________ __________ ________ _____ _____ ___ _________.
_______ ___ ___ __________ ___ ________ ________ _____ _______ ________.
____ ___ _______ ____ ___ ________ __________.
___ ____ ____ _____ ____ ________ _________ __________ _______ ________ _____.
___ ________ _________ ______ ____ _______ ___ _____ __________.
__________ _________ _______ ___ ____ _________ __________.
_______ ______ _________ ______ _____ ___ ________ _____ _____.
_______ _____ ______ _________ __________ _______ _____.
_________ ________ ____ ____ ____ _________ _______ _________ _________ ______ _________ _______.
________ __________ _________ ______ ____ _________ _________ __________ __________ ______.
______ ____ ____ ______ ____ ______.
Get Full Answer on WhatsApp
To solve this problem using the graphical method (also known as the two-machine flow shop scheduling method), we need to minimize the total elapsed time for completing both Job 1 and Job 2 across five machines. ### Step 1: Organize Data We have the following data for Job 1 and Job 2: #### Job 1: | Machine | Sequence | Time (hours) | |---------|----------|--------------| | A | 1 | 1 | | B | 2 | 2 | _______ _________ _________ _______ _______.
_______ _______ ______ _______ _______ _____ _______ _____ ___ ____.
_______ _________ _________ ____ ________ ___ _______ _______ ____ _________ _________.
____ _____ _____ ____ __________ ____ ________ _______.
________ _______ _______ _______ __________.
___ ________ __________ ___ ________ ____ ____.
_________ _______ __________ _________ ___ _______ __________ _______ ___ _____ ___.
_______ ______ _______ __________ _____ ____ ___ __________ ______ ___ ______ __________.
________ ______ ________ __________ ____ ____.
_______ _______ _________ __________ ____ __________.
________ _____ ___ _______ ______ ____.
_____ ___ __________ _______ ____ _________ __________ _____ _____ ________ _____ ______.
_______ __________ ___ _____ ______ _________ _______ _______ ____ ______ _________.
_______ ________ __________ ______ _____ _______ _____ ________ _________ __________.
______ ____ ___ ________ __________ ________.
____ ______ ____ ____ _______ _____ ________ _____.
______ _________ ______ __________ ___ ____.
__________ _________ ________ _________ __________ _______ ___ ________ ________ _________ _________.
____ _____ ________ __________ _____ ________ ______ __________ __________ __________.
_________ ________ ___ ___ _________ _____ ___ ______ ____ ____ _____ _____.
_______ ___ __________ __________ ______ _________ _______ ___ ______.
_____ _______ __________ _________ ________ __________.
____ ________ __________ ___ ________ ______ _____ ____.
_____ ___ _____ __________ __________ _________ _________ ______ _______ _______ ___.
____ ________ ___ __________ ____ __________ ____ _______ _________ _____.
_______ _____ ______ __________ ________ _______ _________ ___ __________.
___ _____ _____ ___ ________ _____ ________ ___ _______ ______ ___ _____.
_______ ____ _______ _____ ___ _________ _____.
______ ________ _________ __________ ______ ______.
_______ _________ ____ ____ _______ _________ ________.
_________ _________ _____ ______ _____ ____ ____ ______ ___ ____.
_____ _________ ____ ______ ____ __________ __________ _____.
______ ________ _______ __________ _______ ____ ________ __________ _____ ______ _______.
________ ______ _________ __________ ___ _______ _________ ________ ____ ________.
____ ___ ____ __________ __________ ________ _____ _____ ___ _________.
_______ ___ ___ __________ ___ ________ ________ _____ _______ ________.
____ ___ _______ ____ ___ ________ __________.
___ ____ ____ _____ ____ ________ _________ __________ _______ ________ _____.
___ ________ _________ ______ ____ _______ ___ _____ __________.
__________ _________ _______ ___ ____ _________ __________.
_______ ______ _________ ______ _____ ___ ________ _____ _____.
_______ _____ ______ _________ __________ _______ _____.
_________ ________ ____ ____ ____ _________ _______ _________ _________ ______ _________ _______.
________ __________ _________ ______ ____ _________ _________ __________ __________ ______.
______ ____ ____ ______ ____ ______.
Get Full Answer on WhatsApp
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★