The objective of this paper is to propose a new method for scheduling the jobs at the minimum cost/max profit. Depending on the objective we want to optimize, we obtain the usual assignment problems. Assignment problem is an important subject discussed in real physical world we endeavor in this paper to introduce a new approach to assignment problem namely, SI method for solving wide range of problem. It is easy to understand and is very efficient for decision makers. It can easily be adopted. The completion of assigning the jobs can be assigned just in a few steps by using this method. Also some of the examples are given for the allocations by the given method in this paper.
Assignment problem, Hungerian assignment method, job scheduling, optimal solution, SI method
