1. Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3), 391–401.
2. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. Englewood Cliffs, NJ: Prentice Hall.
3. Artigues, C., Billaut, J.-C., & Esswein, C. (2005). Maximization of solution flexibility for robust shop scheduling. European Journal of Operational Research, 165(2), 314–328.
4. Baykasoglu, A., Özbakir, L., & Dereli, T. (2002). Multiple dispatching rule based heuristic for multi-objective scheduling of job shops using tabu search. Proceedings of the 5th International Conference on Managing Innovations in Manufacturing (pp 396–402). Milvaukee, WI.
5. Billaut, J.-C. (1993). Prise en compte des ressources multiples et des temps de préparation dans les problèmes d'ordonnancement en temps réel. Ph.D. Thesis, Université Paul Sabatier, Toulouse, France.