References
- Garey , M. and D , Johnson . 1979 . “ Computers and interactibility ” . In A Guide to the theory of NP-Completness , Sn Francisco, CA : W.H. Freeman and Company .
- Assman , S.B. , D.J , Johnson , D.J , Klietman and J. Y.T , Leung . 1984 . On a dual version of the one dimensional bin packing problem . J.of Algorithms ,
- Baker B.S. A new proof for thefirstfit decreasing bin packing algorithm 07974 Technical memorandum, Bell Laboratories Murray Hill, N.J. 1983
- Baker , B.S. and E.G , Coffman . 1981 . A tight asymptotic bound for next-fit-decreasing binpacking algorithm . SI AM J. Alg. Disc. Math , 2 : 147 – 152 .
- Lin F.T. Kao C.Y. A stochastic approach for the onedimensional binpacking problem in Proc. 1992 IEEE Int. Conf Syst. Man. Cybern. Chicago, Illinois 1992 18 21
- Coffman , E.G. , M.R , Jr. Garey and D.S , Johnson . “ Approximation algorithms for binpacking: An updated survey ” . Murray Hill, New Jersey : Bell laboratories .
- Holland , J.H. 1975 . “ Adaption in natural and Artifical Systems ” . In Ann Arbor , MI: The University of Michigan Press .
- Sankar , K.P. and D , Bhandari . 1994 . Selection of optimal set of weights in a layered network using genetic algorithms . Information sciences , 80 : 213 – 234 .
- Chuen-Leung , C. , S.V , Venkateswara and N , Aljaber . 1995 . An application of genetic algorithms for flow shop problems . European Journal of Operational Research , 80 : 389 – 396 .
- Clyde W.H. Varghese S.J. Pakath R. Zavery J.S. A geneticbased hybrid scheduler for generating static schedules in Flexible Manufacturing contexts IEEE transaction on systems, man and cybernatics, 23(4) July/Aug 1993
- Goldberg , D.E. “ Genetic Algorithms in Search ” . In Optimization and Machine Learning Edited by: Wesley , Addison .
- Bhandari , D. , R.P , Nikhil and K.P , Sankar . 1994 . Directed mutation in genetic algorithms . Information Sciences , 79 : 251 – 270 .