References
- Buchanan , I. (1995) . Mathematical programming and resource management . BT Technical J. , 13 : 29 – 37 .
- Dantzig G. B. Linear Programming and Extensions Princeton UP (1963)
- Bixby , R. E. (1994) . Progress in linear programming . ORSA J. Comp. , 6 : 15 – 20 .
- Lawler , E. W. and Wood , D. E. (1966) . Branch and bound methods: a survey . Oper. Res. , 14 : 699 – 719 .
- Hall P. A. V. Branch and bound and beyond Proc. International Joint Conference on AI (1971) pp. 641–650
- Glover , F. (1989) . Tabu search: Part-I . ORSA J. Comp. , 1 : 109 – 206 .
- Glover , F. (1990) . Tabu search: Part-II . ORSA J. Comp. , 2 : 4 – 32 .
- Leachman R. C. Modelling techniques for automation production In: Ciriani and R. C. Leachman (Eds.) Optimisation in Industry: Mathematical Programming and Modelling Techniques in Practice Wiley (1993) pp. 1–30
- Goldberg D. E. Genetic algorithms in search Optimisation and Machine Learning Addison-Wesley Pub. Co. Inc. (1989)
- Fox M. Constraint Directed Search: A Case Study of Job-Shop Scheduling Morgan Kaufman (1987)
- Davis L. (Ed.) Handbook of Genetic Algorithms Von Nostrand Reinhold (1991)
- Lever , J. , Wallace , M. and Richards , B. (1995) . Constraint logic programming for scheduling and planning . BT Technical J. , 13 : 73 – 80 .
- Minton S. Johnston M. D. Philips A. B. Laird P. Solving large scale constraint satisfaction and scheduling problems using a heuristic repair method Proc. National Conference on Artificial Intelligence-AIII (1990) pp. 17–24
- Tsang , E. P. K. (1995) . Scheduling technique: a comparative study . BT Technical J. , 13 : 16 – 28 .
- Azarmi , N. and Abdul Hameed , W. (1995) . Work force scheduling with constraint logic programming . BT Technical J. , 13 : 18 – 94 .
- Aarts E. Korst J. Simulated Annealing and Boltzman Machines John Wiley and Sons (1989)
- Holland J. H. Adaptation in Natural and Artificial Systems The University of Michigan Press (1975)