Urlings, T. (2010). Heuristics and metaheuristics for heavily constrained hybrid flowshop problems. PhD thesis, Universidad Politecnica de valencia, France.
 Lee, C.Y., Cheng, T.C.E., Lin, B.M.T. (1993). Minimizing the makespan in the 3-machine assembly-type flow shop scheduling problem, Management Science, 39 (5), 616-625.
 Park, M.W., Kim, Y.D. (2000). A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints, European Journal of Operational Research, 123: 504-518.
 Tozkapan, A. K., Chung, C.S. (2003). A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly-scheduling problem, Computers & Operations Research, 30: 309-320.
 Yokoyama, M. (2004). Scheduling for two-stage production system with setup and assembly operations, Computers & Operations Research, 31: 2063–2078.
 Yokoyama, M., Santos, D.L. (2005). Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times, European Journal of Operational Research, 161: 754-770.
 Allahverdi, A., Al-Anzi, F.S. (2006). A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times, European Journal of Operational Research, 169: 767-780.
 Yokoyama, M. (2008). Flow-shop scheduling with setup and assembly operations, European Journal of Operational Research, 187: 1184–1195.
 Sung, C.S., Kim, H.A. (2008). A two-stage multiple-machine assembly-scheduling problem for minimizing sum of completion times, International Journal of Production Economics, 113: 1038-1048.
 Fattahi, P., Hosseini, S.M.H., Jolai, F., Tavakkoli-moghadam, R. (2014). A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations, Applied Mathematical Modelling, 38: 119–134.
 Yao, L., Sarin, C.S. (2014). Multiple-Lot Lot Streaming in a Two-stage Assembly System, Essays in Production, Project Planning and Scheduling, 357-388.
 Lee, J.Y., Bang, J.Y. (2016). A Two-Stage Assembly-Type Flowshop Scheduling Problem for Minimizing Total Tardiness, Mathematical Problems in Engineering, 6409321.
 Lin, W.C. (2018). Minimizing the Makespan for a Two-Stage Three-Machine Assembly Flow Shop Problem with the Sum-of-Processing-Time Based Learning Effect, Discrete Dynamics in Nature and Society, 1-15.
 Hosseini, S.M.H., Hassani, A.A. (2017). Proposed a branch and bound algorithm for Assembly flow shop scheduling problem, Journal of Modeling in Engineering, 15: 85-98.
 Luo, J.C., Liu, Z.Q., Xing, K.Y. (2019). Hybrid branch and bound algorithms for the two-stage assembly-scheduling problem with separated setup times, International Journal of Production Research, 57: 1398-1412.
 Hosseini, S.M.H. (2019). Modelling and solving the job shop scheduling Problem followed by an assembly stage considering maintenance operations and access restrictions to machines. Journal of Optimization in Industrial Engineering, 12(1), 63-78. DOI: 10.22094/joie.2018.760.1484.
 Fattahi, P., Rad, N. B., Daneshamooz, F., & Ahmadi, S. (2020). A new hybrid particle swarm optimization and parallel variable neighborhood search algorithm for flexible job shop scheduling with assembly process. Assembly Automation.
 Zhang, S., & Wang, S. (2018). Flexible assembly job-shop scheduling with sequence-dependent setup times and part sharing in a dynamic environment: Constraint programming model, mixed-integer programming model, and dispatching rules. IEEE Transactions on Engineering Management, 65(3), 487-504.
 Defersha, F. M., & Movahed, S. B. (2018). Linear programming assisted (not embedded) genetic algorithm for flexible job shop scheduling with lot streaming. Computers & Industrial Engineering, 117, 319-335.
 Shi, F., Zhao, S., Meng, Y. (2020). Hybrid algorithm based on improved extended shifting bottleneck procedure and GA for assembly job shop scheduling problem. International Journal of Production Research, 58: 2604-2625.
 Wang, H., Sarker, B.R., Li, J., Li, J. (2020). Adaptive scheduling for assembly job shop with uncertain assembly times based on dual Q-learning. International Journal of Production Research, 1-18.
 Land, A.H., Doig, A.G. (1960). An automatic method of solving discrete programming problems. Econometrica, 28: 497-520.
 Ghanbari, R. Heydari, A. (2015). A two-phase variable neighborhood search for solving nonlinear optimal control problems. Iranian Journal of Numerical Analysis and Optimization, 5:13-36.