CONSTRAINT TIME MINIMIZING ASSIGNMENT PROBLEM – GENETIC ALGORITHM

SOBHAN BABU K, K.Chandra Kala

Abstract


In this paper we present a new method for a problem called constraint Time minimizing Assignment problem. The proposed method uses the well-known Genetic algorithm.

Keywords


Assignment Problem, Time Constraint, Genetic Algorithm,

Full Text:

PDF

References


R.S.Garfinkel, “An improved algorithm for bottleneck assignment problem”, Operations Research 18 (1971), 1717-1751.

Shalini Arora, M.C.Prui, “A variant of time minimizing assignment problem”, European Journal of Opearions Research 110(1998) 314-325.

Anshuman Sahu, Rudrajit Tapadar, “Solving the Assignment problem using Genetic algorithm and Simulated Annealing”, International Journal of Applied Mathematics, 36:1, IJAM.(2007)

Fredric S. Hillier “Introduction to Mathematical Programming”, Stanford University, Mac Graw-Hill Inc. (1995).

Goldberg .D.E. “Optimization and Machine Learning”, Genetic Algorithm in Search, (1989).

Addison-Wesley, Mitchell ,”An introduction to Genetic Algorithm” MIT Press, (1996).

Patricia D. Novak, “Dorland’s Pocket Medical Dictionary” W.B. Saunders Company.

Thomas Dean, James Allen, “Artificial Intelligence Theory & Practice”, The Benjamin/Cumming Publishing Company Inc. Redwood City, California 94665. (1995).




DOI: https://doi.org/10.26483/ijarcs.v8i9.4989

Refbacks

  • There are currently no refbacks.




Copyright (c) 2017 International Journal of Advanced Research in Computer Science