1. Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117–129.
2. Ma, P. C., Tao, F., Liu, Y. L., et al. (2014). A hybrid particle swarm optimization and simulated annealing algorithm for job-shop scheduling. In IEEE international conference on automation science and engineering. IEEE (pp. 125–130).
3. Ryan, D. M., & Foster, B. A. (1981). An integer programming approach to scheduling. Publication of Elsevier Science Publishers Bv, 1, 269–280.
4. Brucker, P., Jurisch, B., & Sievers, B. (1998). A branch and bound algorithm for the job-shop scheduling problem. In A. Drexl & A. Kimms (Eds.), Beyond manufacturing resource planning (MRP II) (pp. 107–127). Berlin: Springer.
5. Nawaz, M., Enscore, E. E., Jr., & Ham, I. (1983). A heuristic algorithm for the m -machine, n -job flow-shop sequencing problem. Omega, 11(1), 91–95.