Master Job Sequencing for minimum total time

Description

This course was designed to meet the requirements of the BMS course of Mumbai University, India. Basic modules in Sequencing Models and Game Theory, will be introduced here. Sequencing will comprise of 2 machine, ‘n’ jobs case and 3 machines, ‘n’ jobs case. In a two machine sequencing case the algorithm is quite simple and straight forward. The simple algorithm can be extended to a three or four or more machines case, subject to certain terms and conditions. For example in a 3 machine case, the maximum processing time for an item on the middle machine must be less than or at most equal to the lowest processing time on the first or the third machine or both. If this condition is not satisfied, there is no option but to solve the problem by enumeration, that is by working out all possible alternatives manually. This can be a mammoth job since even in a simple 5 job scenario, there would be 5! or 120 ways to enumeration. The moment you take up a 7 job case, the number of ways it can be scheduled becomes more than 5000. The algorithm can be extended in simple cases which meet the above requirements. In Game Theory, basically the language of game theory will be introduced to the student. Terms such as zero-sum, two-person, saddle point, pay-offs etc will be introduced. To take the understanding further, I have put up two free courses on udemy. In those courses, solution of a game using Linear Programming is also covered. While of the subject of game theory, the principle of Dominance is also introduced. Games without saddle point will however be excluded from the purview of this chapter.

TAKE THIS COURSE