Advertisements
Advertisements
Question
In sequencing problems one has to ______ the total processing time or cost
Solution
minimize
APPEARS IN
RELATED QUESTIONS
The time interval between starting the first job and completing the last job including the idle time (if any) in a particular order by the given set of machines is called _______.
Fill in the blank :
In a sequencing problem, all machines are of _______ types.
Choose the correct alternative:
The objective of sequencing problem is ______
In sequencing problem the time which required to complete all the jobs i.e. entire task is called ______
In sequencing problem one has to determine the ______ in which jobs has to processed through the machines
State whether the following statement is True or False:
In sequencing problem the processing times are dependent of order of processing the jobs on machine
Solve the following problem of sequencing for minimizing the total elapsed time and idle time for both the machines.
| Job | P | Q | R | S | T | U |
| M1 | 1 | 4 | 6 | 3 | 5 | 2 |
| M2 | 3 | 6 | 8 | 8 | 1 | 5 |
The optimal sequence of the jobs as follows:
Total elasped time is obtained as follows:
| Job sequence |
Machine A | Machine B | Idle time for Machine B |
||
| Time In |
Time Out |
Time In |
Time Out |
||
| P | `square` | 1 | 1 | `square` | `square` |
| U | `square` | 3 | 4 | `square` | `square` |
| S | `square` | 6 | 9 | `square` | `square` |
| Q | `square` | 10 | 17 | `square` | `square` |
| R | `square` | 16 | 23 | `square` | `square` |
| T | `square` | 21 | 31 | `square` | `square` |
Total elapsed time T = `square` minutes
Idle time for Machine A = T – `square` = `square` minutes
Idle time for Machine B = `square`
