1. Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Manage. Sci. 34(3), 391–401 (1988).
http://www.jstor.org/stable/2632051
2. Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA J. Comput. 3(2), 149–156 (1991).
https://doi.org/10.1287/ijoc.3.2.149
3. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);G Col Da,2016
4. Danna, E., Rothberg, E., Le Pape, C.: Integrating mixed integer programming and local search: a case study on job-shop scheduling problems. In: Fifth International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR’2003), pp. 65–79 (2003)
5. Fox, M.S., Allen, B.P., Strohm, G.: Job-shop scheduling: an investigation in constraint-directed reasoning. In: AAAI, pp. 155–158 (1982)