JOB SEQUENCING PROBLEM 2 - Processing n Jobs through 3 Machines by beinggourav.com скачать в хорошем качестве

JOB SEQUENCING PROBLEM 2 - Processing n Jobs through 3 Machines by beinggourav.com

Job Sequencing problem : Johnson's rule for processing n jobs through 3 machines. in this video you are going to learn job sequencing problem 1 - processing n jobs through 3 machines. Let there be ‘n’ jobs each of which is to processed through three machines say A, B & C in the order ABC. No passing off jobs is permitted and actual processing time in all the three machine is known. The problem again is to find the optimum sequences which minimizes T (Processing Time) . However previous method given by Johnson can be applied if the following two conditions are satisfied. Condition 1: the minimum of the times for different jobs on machine A is at least equal to the maximum of the times of different jobs on machine B. Condition 2: The minimum of the times for different jobs on machine C is at least equal to the maximum of the times of different jobs in machine B. If the above two are not satisfied the method fails otherwise we can proceed. Replace the given problem with an equal problem involving ‘n’ jobs two machines here two machines fictitious say G & H . Now apply the same procedure and find out the optimal sequence which shall also be optimal for the original problem. Thanks and Regards Team BeingGourav.com ~-~~-~~~-~~-~ Please watch: "UNBALANCED ASSIGNMENT PROBLEM IN OPERATION RESEARCH | USING HUNGARIAN METHOD | Lecture 03"    • Unbalanced Assignment Problem | Using Hung...   ~-~~-~~~-~~-~