International Journal of Engineering and Management Research (IJEMR)
  • Year: 2016
  • Volume: 6
  • Issue: 4

A Direct method to obtain Optimal Solution for Assignment Problem

  • Author:
  • A. Seethalakshmy1, N. Srinivasan2, D. Iranian3
  • Total Page Count: 5
  • Page Number: 322 to 326

1Assistant Professor, Department of Mathematics, St. Peter's College of Engineering and Technology, Chennai, India

2Professor, Department of Mathematics, St. Peter's University, Chennai, India

3Professor, Department of Mathematics, Panimalar Institute of Technology, Chennai, India

Online published on 24 October, 2017.

Abstract

The aim of this paper is to propose a direct method for scheduling jobs at the minimum cost/maximum profit. In this process we define the assignment matrix, then by using the determinant representation we obtain a reduced matrix which has at least one zero in each row. The proposed method is systematic procedure, easy to apply and less calculation time. At the end this method is illustrated with some numerical examples.

Keywords

Assignment problems, cost matrix, maximum profit, optimization