1. Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Manage. Sci. 34, 391–401 (1988)
2. Aggoun, A., Beldiceanu, N.: Extending chip to solve complex scheduling and placement problems. J. Math. Comput. Model. 17(7), 57–73 (1993)
3. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)
4. Alekhnovich, M., Buss, S., Moran, S., Pitassi, T.: Minimum propositional proof length is NP-hard to linearly approximate. In: Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science. Springer, New York (1998)
5. Asarin, E., Bozga, M., Kerbrat, A., Maler, O., Pnueli, A., Rasse, A.: Data structures for verification of timed automata. In: Proceedings of the Hybrid and Real-Time Systems (1997)