1. Abdennadher, S., & Schlenker, H. (1999). Proceedings of the Innovative Applications iof Artificial Intelligence Conference, 838–843.
2. Aldowaisan, T.A. (2001). A new heuristic and dominance relations for no-wait flowshops with setups. Computers & OR, 28(6), 563–584.
3. Backofen, R., & Will, S. (1999). Excluding symmetries in constraint-based search. Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming CP1999, volume 1713 of LNCS, (pp. 73–87): Springer.
4. Brucker, P., Drexl, A., Möhring, R.H., Neumann, K., Pesch, E. (1999). Resource-constrained project scheduling, Notation, classification, models, and methods. European Journal of Operational Research, 112(1), 3–41.
5. Chu, G., & Stuckey, P.J. (2012). A generic method for systematically identifying and exploiting dominance relations. In Proceedings of the 18th International Conference on Principles and Practice of Constraints Programming CP2012, number 7514 in LNCS, (pp. 6–22): Springer.