1. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
2. Drabowski, M., Wantuch, E.: Deterministic schedule of task in multiprocessor computer systems with higher degree of dependability. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds.) Advances in Intelligent Systems and Computing, Proceedings of the Ninth International Conference on Dependability and Complex Systems DepCos-RELCOMEX, vol. 286, pp. 165–175. Springer (2014)
3. Dick, R.P., Jha N.K.: MOGAC: a multiobjective genetic algorithm for the cosynthesis of hardware-software embedded systems. In: Proceedings of the International Conference on Computer Aided Design, pp. 522–529 (1997)
4. Błażewicz, J., Drabowski, M., Węglarz, J.: Scheduling multiprocessor tasks to minimize schedule length, IEEE Trans. Comput. C-35(5), 389–393 (1986)
5. Drabowski, M.: Boltzmann tournaments in evolutionary algorithm for cad of complex systems with higher degree of dependability. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds.) Advances in Intelligent Systems and Computing, The Tenth International Conference on Dependability and Complex Systems DepCos-RELCOMEX, vol. 365, pp. 141–152. Springer (2015)