Author:
Dao Son Duy,Marian Romeo Marin
Reference23 articles.
1. Yen C, Tseng SS, Yang CT (1995) Scheduling of precedence constrained tasks on multiprocessor systems. In: Proceedings of IEEE first international conference on algorithms and architectures for parallel processing, Brisbane, QLD, Australia, 19–21 April 1995, pp 379–382
2. Zou D, Gao L, Li S, Wu J (2011) Solving 0–1 knapsack problem by a novel global harmony search algorithm. Appl Soft Comput 11:1556–1564
3. Chen CLP (1990) AND/OR precedence constraint traveling salesman problem and its application to assembly schedule generation. In: Proceedings of IEEE international conference on systems, man and cybernetics, Los Angeles, CA, USA, 4–7 November 1990, pp 560–562
4. Marian RM (2003) Optimisation of assembly sequences using genetic algorithms. PhD Thesis, University of South Australia, Adelaide
5. Marian RM, Luong LHS, Abhary K (2006) A genetic algorithm for the optimisation of assembly sequences. Comput Ind Eng 50(4):503–527
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献