Aguirre, A.M., & Papageorgiou, L.G. (2018). Medium-term optimization-based approach for the integration of production planning, scheduling and maintenance. Computers and Chemical Engineering, 116, 191–211.
Attar, S.F., Mohammadi, M., & Tavakkoli-Moghaddam, R. (2013). Hybrid flexible flow-shop scheduling problem with unrelated parallel machines and limited waiting times. International Journal of Advanced Manufacturing Technology, 68(5-8), 1583-1599.
Cho H.-M., & Jeong I.-J. (2017). A two-level method of production planning and scheduling for bi-objective reentrant hybrid flow shops. Computers and Industrial Engineering, 106, 174-181.
Ebrahimi, M., Fatemi Ghomi, S.M.T., & Karimi, B. (2014). Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates. Applied Mathematical Modelling, 38(9-10), 2490-2504.
Erdirik-Dogan, M., & Grossmann, I.E. (2006). A decomposition method for simultaneous planning and scheduling of single-stage continuous multiproduct plants. Industrial and Engineering Chemistry Research, 45(1), 299–315.
Erdirik-Dogan, M., & Grossmann, I.E. (2008). Simultaneous planning and scheduling of single-stage multi-product continuous plants with parallel lines. Computers and Chemical Engineering, 32(11), 2664–2683.
Glover, F. (1989a). Tabu search, part I. ORSA Journal on Computing, 1(3), 190–206.
Glover, F. (1989b). Tabu search – Part II. ORSA Journal on Computing, 2(1), 4-32.
Gupta, J.N.D. (1988). Two-stage hybrid flow shop scheduling problem. Journal of the Operational Research Society, 39 (4), 359–364.
Hoogeveen, J.A., Lenstra, J.K., & Veltman, B. (1996). Preemptive scheduling in a two-stage multiprocessor flow shop is np-hard, European Journal of Operational Research, 89 (1), 172–175.
Hosseini, S.M.H. (2017). A multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation. Journal of Industrial and Systems Engineering, 10, 132-154.
Jankauskas, K., Papageorgiou, L.G., & Farid, S.S. (2019). Fast genetic algorithm approaches to solving discrete-time mixed integer linear programming problems of capacity planning and scheduling of biopharmaceutical manufacture. Computers and Chemical Engineering, 121, 212–223.
Kim, S.H., & Lee, Y.H. (2016). Synchronized production planning and scheduling in semiconductor fabrication. Computers & Industrial Engineering, 96, 72-85.
Li, J.-Q., & Pan, Q.-K. (2015). Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Information Sciences, 316, 487-502.
Li, J.-Q., Sang, H.-Y., Han, Y.-Y., Wang, C.-G., & Gao. K.-Z. (2018). Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions. Journal of Cleaner Production, 181, 584-598.
Low, C., Hsu, C.-J., & Su, C.-T. (2008). A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines. Computers & Operations Research, 35 (3), 845-853.
Mousavi, S.M., Mahdavi, I., Rezaeian, J., & Zandieh, M. (2018). Bi-objective scheduling for the re-entrant hybrid flow shop with learning effect and setup times. Scientia Iranica E, 25(4), 2233-2253.
Pan, Q.-K., Gao. L., Li, X.-Y., & Gao. K.-Z. (2017). Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times. Applied Mathematics and Computation, 303, 89-112.
Rajaee Abyaneh, F., & Gholami, S. (2015). A comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times. Journal of Industrial and Systems Engineering, 8(2), 67-85.
Riane, F., Artiba, A., & Iassinovski, S. (2001). An integrated production planning and scheduling system for hybrid flowshop organizations. International Journal of Production Economics, 74 (1–3), 33–48.
Safari, G., Hafezalkotob
, A., & Khalilzadeh
, M. (2017). A novel mathematical model for a hybrid flow shop scheduling problem under buffer and resource limitations-A case study. Journal of Industrial and Systems Engineering
, 10, 58-77.
Soltani, S., & Karimi, B. (2015). Cyclic hybrid flow shop scheduling problem with limited buffers and machine eligibility constraints. International Journal of Advanced Manufacturing Technology, 76(9-12), 1739-1755.
Terrazas-Moreno, S., & Grossmann, I.E. (2011). A multiscale decomposition method for the optimal planning and scheduling of multi-site continuous multiproduct plants. Chemical Engineering Science, 66(19), 4307–4318.
Wang, X., & Tang, L. (2009). A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers. Computers & Operations Research, 36(3), 907–918.
Wardono, B., & Fathi, Y. (2004). A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. European Journal of Operational Research, 155(2), 380–401.
Yu, C., Semeraro, Q., & Matta,A. (2018). A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility. Computers & Operations Research, 100, 211–229.
Zandieh, M., Fatemi Ghomi, S.M.T., & Moattar Husseini, S.M. (2006). An immune algorithm approach to hybrid flow shops scheduling with sequence dependent setup times. Applied Mathematics and Computation, 180 (1), 111–127.
Zhang, X.Y., & Chen, L. (2018). A re-entrant hybrid flow shop scheduling problem with machine eligibility constraints. International Journal of Production Research, 56(16), 1-13.