Allahverdi, A. (2005). Two-machine flowshop scheduling problem to minimize makespan with bounded setup and pro-cessing times. Int. Journal of Agile Manufacturing, 8,145–153.
Allahverdi, A. (2006a). Two-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times. Kuwait Journal of Science and Engineering, 33(2), 233–251.
Allahverdi, A. (2006b). Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times. International Journal of Production Economics, 103, 386–400.
Allahverdi, A. (2015). The third comprehensive survey on scheduling problems with setup times/costs. European Jour-nal of Operational Research, 246(2), 345–378.
Allahverdi, A. (2016). A survey of scheduling problems with no-wait in process. European Journal of Operational Re-search, 255(3), 665–686.
Allahverdi, A., Aldowaisan, T., & Sotskov, Y. (2003). Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times. International Journal of Mathematics and Mathematical Sciences, 39, 2475–2486.
Allahverdi, M., & Allahverdi, A. (2020). Minimizing total completion time in a two-machine no-wait flowshop with un-certain and bounded setup times. Journal of Industrial and Management Optimization, 16(5), 2439–2457.
Baker, K. R., & Trietsch, D. (2009). Principles of Sequencing and Scheduling.
Cunningham, A. A., & Dutta, S. K. (1973). Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop. Naval Research Logistics Quarterly, 20(1), 69-81.
Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in pro-cess. Operations Research, 44(3), 510-525.
Kalczynski, P. J., & Kamburowski, J. (2006). A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation. European Journal of Operational Research, 169(3), 742-750.
Kim, S. C., & Bobrowski, P. M. (1997). Scheduling jobs with uncertain setup times and sequence dependency. Omega, 25(4), 437-447.
Kopanos, G. M., Laínez, J. M., & Puigjaner, L. (2009). An efficient mixed-integer linear programming scheduling framework for addressing sequence-dependent setup issues in batch plants. Industrial & Engineering Chemistry Re-search, 48(13), 6346-6357.
Ku, P. S., & Niu, S. C. (1986). On Johnson's two-machine flow shop with random processing times. Operations Re-search, 34(1), 130-136.
Li, X., Yang, Z., Ruiz, R., Chen, T., & Sui, S. (2018). An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects. Information Sciences, 453, 408–425.
Seo, D. K., Klein, C. M., & Jang, W. (2005). Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models. Computers & Industrial Engineering, 48(2), 153-161.
Soroush, H. M. (1999). Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs. European Journal of Operational Research, 113(2), 450-468.
Soroush, H. M. (2007). Minimizing the weighted number of early and tardy jobs in a stochastic single machine schedul-ing problem. European Journal of Operational Research, 181(1), 266-287.
Ying, K. C., & Lin, S. W. (2018). Minimizing makespan for no-wait flowshop scheduling problems with setup times. Computers & Industrial Engineering, 121, 73-81.