1. M.R. Garey, D.S. Johnson, “Computers and Intractability: A guide to the Theory of NP-Completeness”, W. H. Freeman and Company, New York, 1979.S.
2. Martello and P. Toth, “Knapsack Problems. Algorithms and Computer. Implementations”, DEIS University of Bologna, John Wiley & Sons, England, 1990.
3. J. Pérez Ortega, H. Castillo Zacatelco, D. Vilariño Ayala, A. Mexicano Santoyo, J. C. Zavala Díaz, A. Martínez Rebollar, H. Estrada Esquivel, “Una nueva estrategia de solución para instancias del problema de bin packing”, Computación y Sistemas, en revisión final, 2015.
4. Scheduling with timed automata
5. On size reduction techniques for multitape automata