1. Apple Computer Inc. (2004). Xgrid guide. Cupertino: Apple Computer Inc.
2. Blum, C. (2005). Beam-ACO—hybridizing ant colony optimization with beam search: An application to open shop scheduling. Computers & OR, 32, 1565–1591.
3. Brucker, P., Hurink, J., Jurisch, B., & Wöstmann, B. (1997). A branch & bound algorithm for the open-shop problem. Discrete Applied Mathematics, 76, 43–59.
4. Crawford, J. M., & Baker, A. B. (1994). Experimental results on the application of satisfiability algorithms to scheduling problems. In Proceedings of the 12th national conference on artificial intelligence (AAAI-94) (pp. 1092–1097).
5. de Kleer, J. (1989). A comparison of ATMS and CSP techniques. In Proceedings of the 11th international joint conference on artificial intelligence (IJCAI 89) (pp. 290–296).