An ecosystems model for integrated production planning

International Journal of Computer Integrated Manufacturing

Volumn 6, Issue 1-2, 1993, Pages 74-86

  Husbands, Philip ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041763087     PISSN: 0951192X     EISSN: 13623052     Source Type: Journal    
DOI: 10.1080/09511929308944557     Document Type: Article

References (36)

1. BALAS, E., 1969, Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Operations Research, 17, 941-957.
2. BELEW, R., and BOOKER, L., 1991, Proceedings of the Fourth International Conference on Genetic Algorithms (Morgan Kaufmann).
3. CARLIER, J., and PINSON, E., 1989, An algorithm for solving the job shop problem. Management Science, 35(2), 164-176.
4. CHANG, T., and WYSK, R., 1985, An Introduction to Automated Process Planning (Prentice-Hall, Englewood Cliffs, NJ, USA).
5. CHAPMAN, D. 1985, Planning for conjunctive goals. Technical. Report AI-TR-802 (MIT AI Laboratories).
6. CHRISTOPHEDES, N., 1979, Combinatorial Optimisation (Wiley).
7. CLEVLAND, G., and SMITH, S., 1989, Using genetic algorithms to schedule flow shop releases. In D. Schaffer (ed.) Proceedings of the Third International Conference on GAs (Morgan Kaufmann) 160-169.
8. DAVIS, L., 1985, Job shop scheduling with genetic algorithms. In J. Grefenstette (ed.) Proceedings of the International Conference on Genetic Algorithmsand their Applications, (Lawrence Erlbaum) 136-140.
9. DAVIS, L. (ed.), 1990, The Handbook of Genetic Algorithms (Van Nostrand Reinhold).
10. GAREY, M., and JOHNSON, D., 1979, Computers and Intractability: A Guide to the Theory of Np-Completeness (W. H. Freeman).
11. GAREY, M., JOHNSON, D., and SETHI, R., 1976, Complexity of Ilowshop and jobshop scheduling. Mathematical Operations Research, 1.
12. GOLDBERG, D., 1989, Genetic Algorithms (Addison-Wesley).
13. GOLDBERG, D., and LINGLE, R., 1985, Alleles, loci and the travelling salesman problem. In J. Grefenstette (ed.) Proceedillgs of the International Conference on GAs and their Applications, (Lawrence Erlbaum) 154-159.
14. GRAVES, S., 1981, A review of production scheduling. Operations Research, 29(4), 646-667.
15. GREFENSTETTE, J. (ed.), 1985, Proceedings of an International Conferencs on GAs and Their Applications (Lawrence Erlbaum).
16. GREFENSTETTE, J. (ed.), 1987, Proceedings of the Second International Conference on GAs. (Lawrence Erlbaum).
17. HARVEY, I. 1992, Species adaptation genetic algorithms: a basis for a continuing SAGA. In F. Varela and P. Bourgine (eds) Proceedings of the First European Conference on Artificial Life (MIT Press).
18. HOLLAND, J., 1975, Adaptation in Natural and Artificial Systems (University of Michigan Press).
19. HILLIARD, M. et al., 1987, A classifier based system for discovering scheduling heuristics. In J. Grcfenstette (ed.) Proceedings of the Second International Conference on GAs (Lawrence Erlbaum) 231-235.
20. HILLIS, W. D., 1990, Co-evolving parasites improve simulated evolution as an optimisation procedure. Physico D, 42, 228-234.
21. HUSBANDS, P., 1988a, The optimisation of process plans. Technical Report 88-03 (Manufacturing Planning Group, Department of Mechanical Engineering, University of Edinburgh, UK).
22. HUSBANDS, P., 1988b, Further process plan optimisation work. Technical Report 88-05 (Manufacturing Planning Group, Department of Mechanical Engineering, University of Edinburgh, UK).
23. HUSBANDS, P., 1992, Genetic algorithms in optimisation and adaptation. In L. Kronsjo and D. Shumsheruddin (eds) Advances in Parallel Algorithms (Blackwell Scientific Publications, Oxford) 227-276.
24. HUSBANDS, P., and MILL, F., 1991, Simulated co-evolution as the mechanism for emergent planning and scheduling. In R. Belew and L. Booker (eds) Proceedings of the Fourth International Conference on Genetic Algorithms (Morgan Kaufmann) 264-270.
25. HUSBANDS, P., MILL, F., and WARRINGTON, S., 1990, Generating optimal process plans from first principles. In E. Balagurusamy and J. Howe (eds) Expert Systems for Management and Engineering (Ellis Horwood, Chichester, UK) 130-152.
26. KOZA, J., 1990, Genetic programming: A paradigm for genetically breeding populations of computer programs to solve problems. Technical Report STAN-CS-90-I3/4 (Department of Computer Science, Stanford University, USA).
27. LIANG, M., and DUTIA, S., 1990, A mixed-integer programming approach to the machine loading and process planning problem ina process layout environment. International Journal of Production Research, 28(8), 1471-1484.
28. MILL, F., PEDLEY, A., and SALMON, J., 1992, Representation problems in feature based approaches to design and process planning. International Journal of Computer Integrated Manufacturing, 6, 27-33.
29. MUTH, J., and THOMPSON, G., 1963, Industrial Scheduling (Prentice-Hall, Englewood Cliffs, NJ, USA).
30. NAKANO, R., and YAMADA, T., 1991, Conventional genetic algorithms for job shop problems. In R. Belew and L. Booker (eds) Proceedings of the Fourth International Conference on GAs (Morgan Kaufmann) 474-479.
31. Ow, P., and SMITH, S., 1988, Viewing scheduling as an opportunistic problem solving process. In R. Jareslow (ed.), Annals of Operations Research, 12, (Baltzer Scientific Publishing).
32. SCHAFFER, J., (ed.), 1989, Proceedings of the Third International Conference on GAs (Morgan Kauffmann).
33. SCHWEFEL, H., and MANNER, R. (eds), 1991, Parallel Problem Solving from Nature, Lecture Notes on Computer Science, 496 (Springer Verlag).
34. SYCARA, K., ROTH, S., SADEH, N., and Fox, M., 1991, Resource allocation in distributed factory scheduing, IEEE Expert, (February 1991), 29-40.
35. TONSHOFF, H., BECKENDORFF, U., and ANDERS, N., 1989, FLEXPLAN-A concept for intelligent process planning and scheduling. In Proceedings CIRP International Workshop on CAPP (IFW, University, Hanover) 87-106.
36. VANGZA, J., and MARGUS, A., 1991, Genetic algorithms III process planning. Computers in Industry, 17, 181-194.