CONSTRAINT TIME MINIMIZING ASSIGNMENT PROBLEM – GENETIC ALGORITHM

Main Article Content

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.

Downloads

Download data is not yet available.

Article Details

Section
Articles

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).