Ghassemi Tari, F., Rezapour Niari, M. (2018). Multi-objective sequence dependent setup times hybrid flowshop scheduling: A literature review. International Journal of Research in Industrial Engineering, 7(3), 254-306. doi: 10.22105/riej.2018.145136.1057

F. Ghassemi Tari; M. Rezapour Niari. "Multi-objective sequence dependent setup times hybrid flowshop scheduling: A literature review". International Journal of Research in Industrial Engineering, 7, 3, 2018, 254-306. doi: 10.22105/riej.2018.145136.1057

Ghassemi Tari, F., Rezapour Niari, M. (2018). 'Multi-objective sequence dependent setup times hybrid flowshop scheduling: A literature review', International Journal of Research in Industrial Engineering, 7(3), pp. 254-306. doi: 10.22105/riej.2018.145136.1057

Ghassemi Tari, F., Rezapour Niari, M. Multi-objective sequence dependent setup times hybrid flowshop scheduling: A literature review. International Journal of Research in Industrial Engineering, 2018; 7(3): 254-306. doi: 10.22105/riej.2018.145136.1057

Multi-objective sequence dependent setup times hybrid flowshop scheduling: A literature review

^{}Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran.

Abstract

Multi-criteria sequence dependent setup times scheduling problems exist almost everywhere in real modern manufacturing world environments. Among them, Sequence Dependent Setup Times-Multi-Objective Hybrid Flowshop Scheduling Problem (SDST-MOHFSP) has been an intensifying attention of researchers and practitioners in the last three decades. In this paper, we briefly summarized and classified the current standing of SDST-MOHFSP. All publications are categorized regarding the solution methods, as well as the structure of the hybrid flowshop which helps researcher and practitioner to use/modify proper solution algorithm for solving their specific problem. Furthermore, based on the review of the existing papers, the need for future research is recognized. Accordingly, by recognizing the research gaps, a large number of recommendations for further study have been proposed.

[1] Abiri, M., Zandieh, M., & Tabriz, A. A. (2009). A tabu search approach to hybrid flow shops scheduling with sequence-dependent setup times. Journal of applied sciences, 9(9), 1740-1745.

[2] Abyaneh, S. H., & Zandieh, M. (2012). Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers. The Int. J. of Ad. Manuf. Tech, 58(1-4), 309-325.

[3] Acosta, J. H. T., González, V. A. P., & Bello C. A. L. (2013). A genetic algorithm for simultaneous scheduling problem in flexible flow shop environments with unrelated parallel machines, setup time and multiple criteria. Int. Conference on Advanced Manuf. Engineering and Tech.

[4] Agnetis, A., Pacifici, A., Ross, F., Lucertini, M., Nicoletti, S., Nicolo, F., & Pesaro, E. (1997). Scheduling of flexible flow lines in an automobile assembly plant. Eur. J. of Operational Res. 97(2), 348-362.

[5] Alaei, R., & Ghassemi-Tari, F. (2011). Development of a genetic algorithm for advertising time allocation problems. Journal of industrial & systems engineering, 4(4), 245-255.

[6] Allahverdi, A., Ng, C., Cheng, T.E., Kovalyov, M.Y. (2008). A survey of scheduling problems with setup times or costs. European journal of operational research, 187(3), 985-1032.

[7] Allahverdi, A., & Aydilek, H. (2015). The two stage assembly flowshop scheduling problem to minimize total tardiness. Journal of intelligent manufacturing, 26(2), 225-237.

[8] Allahverdi, A, (2015). The third comprehensive survey on scheduling problems with setup times/costs. European journal of operational research, 246(2), 345-378.

[9] Alfieri, A, (2009). Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study. International journal of production research, 47(18), 5129-5145.

[10] Amirian, H., Sahraeian, R. (2015). Augmented ε-constraint method in multi-objective flowshop problem with past sequence set-up times and a modified learning effect. Int. J. of Production Res. 53(19), 5962-5976.

[11] Andrés, C., Albarracı́n, J. M., Tormo, G., Vicens, E., & Garcı́a-Sabater, J. P. (2005.) Group technology in a hybrid flowshop environment: A case study. European J. of Operational Res, 167(1), 272-281.

[12] Ashrafi, M., Davoudpour, H., & Abbassi, M. (2014). Investigating the efficiency of GRASP for the SDST HFS with controllable processing times and assignable due dates. Handbook of research on novel soft computing intel. Algorithms: Theory and Pract. Appl (pp. 538-567). IGI Global, 538-567.

[13] Attar, S., Mohammadi, M., Tavakkoli-Moghaddam, R., Yaghoubi, S. (2014). Solving a new multi-objective hybrid flexible flowshop problem with limited waiting times and machine-sequence-dependent set-up time constraints. Int. J. of Comp. Integrated Manuf, 27(5), 450-469.

[14] Azab, SS., & Hefny, HA. (2017). Swarm intelligence in semi-supervised classification. Data mining and knowledge engineering. 9(5): 99-103.

[15] Barabási, B. A. L., & Bonabeau, E. (2003). Scale-free. Scientific american, 288(5), 50-59.

[16] Behnamian, J., Zandieh, M., Fatemi Ghomi, S. M. T. (2009a). Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm. Expert systems with applications, 36(6), 9637-9644.

[17] Behnamian, J., Fatemi Ghomi, S. M. T., & Zandieh, M. (2009b). A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert systems with applications, 36(8), 11057-11069.

[18] Behnamian, J, Zandieh, M., & Fatemi Ghomi, S. M. T. (2009c). Due window scheduling with sequence-dependent setup on parallel machines using three hybrid metaheuristic algorithms. The Int. J. of Ad. Man.Tech, 44(7-8):795-808.

[19] Behnamian, J., Fatemi Ghomi, S. M. T., & Zandieh, M. (2010a). Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times. International journal of production research, 48(5), 1415-1438.

[20] Behnamian, J., Zandieh, M., & Fatemi Ghomi, S. M. T. (2010b). A multi-phase covering Pareto-optimal ront method to multi-objective parallel machine scheduling. Int. J. of Prod. Res, 48(17), 4949-4976.

[21] Behnamian, J., & Zandieh, M. (2011). A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties. Expert Sys. with Appl, 38(12), 14490-14498.

[22] Behnamian, J., Zandieh, M., & Fatemi Ghomi, S. M. T. (2011). Bi-objective parallel machines scheduling with sequence-dependent setup times using hybrid metaheuristics and weighted min–max technique. Soft computing, 15(7), 1313-1331.

[24] Behnamian, J., Fatemi Ghomi, S. M. T., & Zandieh, M. (2012). Hybrid flowshop scheduling with sequence‐dependent setup times by hybridizing max–min ant system, simulated annealing and variable neighbourhood search. Expert systems, 29(2), 156-169.

[25] Behnamian, J., & Zandieh, M. (2013). Earliness and tardiness minimizing on a realistic hybrid flowshop scheduling with learning effect by advanced metaheuristic. Arabian J. for Sc. & Eng. 1-14.

[26] Behnamian, J., Fatemi Ghomi, S. M. T., & Zandieh, M. (2014). Realistic variant of just-in-time flowshop scheduling: Integration of Lp-metric method in PSO-like algorithm. The Int. J. of Ad. Man.Tech, 75(9-12), 1787-1797.

[27] Behnamian, J. (2014). Scheduling and worker assignment problems on hybrid flowshop with cost-related objective function. The Int. J. of Ad. Manuf. Tech, 74(1-4), 267-283.

[28] Blum, C., Roli, A., & Sampels, M. (2008). Hybrid metaheuristics: an emerging approach to optimization (Vol. 114). Springer.

[29] Blum, C., Puchinger, J., Raidl, G. R., & Roli, A. (2011). Hybrid metaheuristics in combinatorial optimization: A survey. Applied soft computing, 11(6), 4135-4151.

[30] Bonabeau, E., Dorigo, M., Theraulaz, G. (1999). Swarm intelligence: from natural to artificial systems. Oxford university press.

[31] Bozorgirad, M. A., & Logendran, R. (2016). A comparison of local search algorithms with population-based algorithms in hybrid flow shop scheduling problems with realistic characteristics. The international journal of advanced manufacturing technology, 83(5-8): 1135-1151.

[32] Brintha, N., Benedict, S., & Jappes, J. W. (2017). A Bio-Inspired Hybrid Computation for Managing and Scheduling Virtual Resources using Cloud Concepts. Appl. math, 11(2),565-572.

[33] Brown, S., McGarvey, R., & Ventura, J. (2004). Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated. J. of the Operational Res. Society, 55(6), 614-621.

[34] Burtseva, L, Yaurima, V, Parra, RR. (2010). Scheduling methods for hybrid flow shops with setup times. T. Aized, Ed, Future Manufacturing Systems (pp. 137-162). Croatia: Sciyo.

[35] Calvet, L., Armas, J. D., Masip, D., & Juan A. A. (2017). Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs. Open mathematics, 15(1), 261-280.

[36] Campbell, H. G., Dudek, R. A., & Smith, M. L. (1970). A heuristic algorithm for the n job, m machine sequencing problem. Management science, 16(10), B-630-B-637.

[37] Campos, S. C., Arroyo, J. E. C., & Tavares, R. G. (2017). A general VNS heuristic for a three-stage assembly flow shop scheduling problem. In Madureira, A., Abraham, A., Gamboa, D., & Novais, P. (Eds). Intel.Sys. Design and Appl. Advances in Intelligent Systems and Computing. Springer, Cham.

[38] Campos, S. C., & Arroyo, J. E. C. (2014). NSGA-II with iterated greedy for a bi-objective three-stage assembly flowshop scheduling problem. Proceedings of the 2014 annual conference on genetic and evolutionary computationly. Vancouver, Canada.

[39] Chang, P. C., Hsieh, J. C., Wang, Y. W. (2003). Genetic algorithms applied in BOPP film scheduling problems: minimizing total absolute deviation and setup times. App. Soft Comp, 3(2), 139-148.

[40] Chang, J., Yan, W., & Shao, H. (2004). Scheduling a two-stage no-wait hybrid flowshop with separated setup and removal times. American control conference. Boston, MA, USA.

[41] Chang, P. C., Chen, S. H., Fan, C. Y., & Chan, C. L. (2008). Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems. Appl. Math. and Comp, 205(2), 550-561.

[42] Chiandussi, G., Codegone, M., Ferrero, S., & Varesio, F. E. (2012). Comparison of multi-objective optimization methodologies for engineering applications. Computers & mathematics with applications, 63(5), 912-942.

[43] Cho, H. M., & Jeong, I. J. (2017). A two-level method of production planning and scheduling for bi-objective reentrant hybrid flow shops. Computers & industrial engineering, 106, 174-181.

[44] Choi, B. C., & Park, M. J. (2016). An ordered flow shop with two agents. Asia-pacific journal of operational research, 33(05).

[45] Ciavotta, M., Minella, G., & Ruiz, R. (2013). Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study. Eur. J. of Operational Res. 227(2), 301-313.

[46] Cochran, J. K., Horng, S. M., & Fowler, J. W. (2003). A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Comp. & Operations Res, 30(7), 1087-1102.

[47] Coello, C. A. C., Lamont, G. B., & Van Veldhuizen, D. A. (2007). Evolutionary algorithms for solving multi-objective problems (Vol. 5). Springer-Verlag US.

[48] Crowder, B. (2006). Minimizing the makespan in a flexible flowshop with sequence dependent setup times, uniform machines, and limited buffers. West Virginia University.

[49] Dannenbring, D. G. (1977). An evaluation of flow shop sequencing heuristics. Management science, 23(11), 1174-1182.

[50] Davoudpour, H., & Ashrafi, M. (2009). Solving multi-objective SDST flexible flow shop using GRASP algorithm. The International J. of Advanced Manufacturing Tech, 44(7), 737-747.

[51] Defersha, F. M. (2015). A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem. Int. Trans.in Operations Res. 22(4), 669–691.

[52] De Weck, O. L. (2004). Multiobjective optimization: History and promise. The third china-japan-korea joint symposium on optimization of structural and mechanical systems. Kanazawa, Japan.

[54] Du, X., Ji, M., Li, Z., & Liu, B. (2016). Scheduling of stochastic distributed assembly flowshop under complex constraints. IEEE Symposium Series on Comp. Intel. Athens, Greece.

[55] Ebrahimi, M., Fatemi Ghomi, S. M. T., & Karimi, B. (2014). Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates. Appl. Math. Modelling, 38(9), 2490-2504.

[56] Eren, T. (2010). A bicriteria m-machine flowshop scheduling with sequence-dependent setup times. Applied mathematical modelling, 34(2), 284-293.

[57] Eskandari, H., & Hosseinzadeh, A. (2014.) A variable neighbourhood search for hybrid flow-shop scheduling problem with rework and set-up times. Journal of the operational research society, 65(8), 1221-1231.

[58] Fadaei, M., & Zandieh, M. (2013). Scheduling a bi-objective hybrid flow Shop with sequence-dependent family setup times using metaheuristics. Arabian J. for Sci. & Eng, 38(8), 2233-2244.

[59] Farahmand-Mehr, M., Fattahi, P., Kazemi, M., Zarei, H., & Piri, A. (2014). An efficient genetic algorithm for a hybrid flow shop scheduling problem with time lags and sequence-dependent setup time. Manufacturing review, 1(21), 1-10.

[60] Fattahi, P., Hosseini, S., & Jolai, F. (2013a). A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem. The Int. J. of Advanced Manuf. Tech, 65(5-8), 787–802.

[61] Fattahi, P., Hosseini, S., & Jolai, F. (2013b). Some heuristics for the hybrid flow shop scheduling problem with setup and assembly operations. Int. J. of Industrial Eng. Computations, 4(3), 393-416.

[62] Fattahi, P., Hosseini, S., Jolai, F., & Tavakkoli-Moghaddam, R. (2014). A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations. Appl. Math. Mod, 38(1),119-134.

[63] Frisch, A. M., Hnich, B., Kiziltan, Z., Miguel, I., & Walsh, T. (2006). Propagation algorithms for lexicographic ordering constraints. Artificial intelligence,170(10), 803-834.

[64] Fu, Y., Wang, H., Huang, M., Ding, J., & Tian, G. (2017). Multiobjective flow shop deteriorating scheduling problem via an adaptive multipopulation genetic algorithm. Proceedings of the institution of mechanical engineers part b journal of engineering manufacture. SAGE Publishing.

[65] Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of np-completeness, computers and intractability: A guide to the theory of NP-Comp. WH Freeman & Co. New York, USA.

[66] Ghafari, E., & Sahraeian, R. (2014). A two-stage hybrid flowshop scheduling problem with serial batching. International journal of industrial engineering and production research, 25(1), 55-63.

[67] Ghassemi-Tari, F., & Olfat, L. (2004). Two COVERT based algorithms for solving the generalized flow shop problems. Proceedings of the 34th Int. Con. on Comp. and Industrial Eng. San Francisco, CA, USA.

[68] Ghassemi-Tari, F., & Olfat, L. (2007). Development of a set of algorithms for the multi-project scheduling problems. Journal of industrial and systems engineering, 1(1), 11-17.

[69] Ghassemi-Tari, F., & Olfat, L. (2008). Covert based algorithms for solving the generalized tardiness flow shop problems. Journal of industrial and systems engineering, 2(3), 197-213.

[70] Ghassemi-Tari, F., & Olfat, L. (2010). A set of algorithms for solving the generalized tardiness flowshop problems. Journal of industrial and systems engineering, 4(3),156-166.

[72] Ghassemi-Tari, F., & Olfat, L. (2014). Heuristic rules for tardiness problem in flow shop with intermediate due dates. The Int. J. of Advanced Manuf. Tech, 71(1-4), 381-393.

[73] Ghassemi Tari, F. & Hashemi Z. (2016). A priority based genetic algorithm for nonlinear transportation costs problems. Computers and industrial engineering, 96(c).

[74] Ghassemi-Tari, F., & Meshkinfam, S. (2017). Improving performance of GAs by use of selective breading evolutionary process. British J. of Math. & Computer Sci, 22(3), 1-21.

[75] Gicquel, C., Hege, L.,. Minoux, M., & Van, W. (2012). A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints. Computers and operations research, 39(3), 629-636.

[76] Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Dec. Sc, 8(1), 156-166.

[77] Gholami, M., Zandieh, M., & Alem-Tabriz, A. (2009). Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. The int. j. of ad. manuf. Tech, 42(1-2), 189–201.

[78] Gholami S., & Rajaee Abyaneh F. (2016). Efficient algorithms for solving flexible flow shop scheduling problem with unrelated parallel machines and sequence-dependent setup times considering earliness/tardiness minimization.

[79] Gómez-Gasquet, P., Andrés, C., & Lario, F. C. (2012). An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan. Exp. Sys.with Appl, 39(9), 8095-8107.

[80] Guinet, A. (1991) Textile production systems: a succession of non-identical parallel processor shops. Journal of the operational research society, 655-671.

[81] Gupta, J. N. (1971). A functional heuristic algorithm for the flowshop scheduling problem. Journal of the operational research society, 22(1), 39-47.

[82] Gupta J. N. (1979). A review of flowshop scheduling research. In Ritzman, L. P., Krajewski, L.J., Berry, W.L., Goodman, S.H., Hardy, S.T., & Vitt, L.D. (Eds), Disaggregation. Springer, Dordrecht, 363-388.

[83] Gupta, J. N., & Darrow, W. P. (1986). The two-machine sequence dependent flowshop scheduling problem. European journal of operational research, 24(3), 439-446.

[84] Gupta, D., Sharma, S., & Nailwal, K. K. (2012). A bicriteria two machine flowshop scheduling with sequence dependent setup time. International journal of mathematical sciences, 11(3-4), 183-196.

[85] Ha, B. B., & Duc, N. N. (2013). Multiple trajectory search for large scale global optimization search-based software testing: past, present and future Wolf search algorithm with ephemeral memory. Int. Conf. on Comp. and Commun. Tech. Res. Innov. and Vision for the Future. Hanoi, Vietnam.

[86] Haddad, M. N., Cota, L. P., Souza, M. J. F., & Maculan, N. (2014). AIV: A heuristic algorithm based on iterated local search and variable neighborhood descent for solving the unrelated parallel machine scheduling problem with setup times. 16th international conference on enterprise information systems. Lisboa, Portugal.

[87] Hakimzadeh Abyaneh, S., & Zandieh, M. (2012). Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers. Int J Adv Manuf Tech, 58(1–4), 309–325.

[88] Harbaoui, H., Bellenguez-Morineau, O., & Khalfallah, S. (2016). Scheduling a two-stage hybrid flow shop with dedicated machines, time lags and sequence-dependent family setup times. IEEE Int. Conference on Systems, Man, and Cybernetics (SMC). Budapest, Hungary.

[89] Hashemi, Z., & Tari, F. G. (2018). A Prufer-based genetic algorithm for allocation of the vehicles in a discounted transportation cost system. International journal of systems science: Operations & logistics, 5(1), 1-15.

[90] Hatami, S., Ebrahimnejad, S., Tavakkoli-Moghaddam, R., & Maboudian, Y. (2010). Two meta-heuristics for three-stage assembly flowshop scheduling with sequence-dependent setup times. The international journal of advanced manufacturing technology, 50(9), 1153-1164.

[91] Hatami, S., García, R. R., Romano, C. A. (2015). The distributed assembly parallel machine scheduling problem with eligibility constraints. Int. J. of Prod. Manag. and Eng, 3(1), 13-23.

[92] He, D.W., Kusiak, A., & Artiba A. (1996). A scheduling problem in glass manufacturing. IIE transactions 28(2), 129-139.

[93] Hecker, F. T., Hussein, W. B., Paquet-Durand, O., Hussein, M. A., & Becker, T. (2013). A case study on using evolutionary algorithms to optimize bakery production planning. Expert systems with applications, 40 (17), 6837-6847.

[94] Hecker, F. T., Stanke, M., Becker, T., & Hitzmann, B. (2014). Application of a modified GA, ACO and a random search procedure to solve the production scheduling of a case study bakery. Expert systems with applications, 41 (13), 5882-5891.

[95] Hekmatfar, M., Ghomi, S. M. T., & Karimi, B. (2011). Two stage reentrant hybrid flow shop with setup times and the criterion of minimizing makespan. Applied soft computing, 11(8), 4530-4539.

[96] Hendizadeh, S. H., ElMekkawy, T. Y., & Wang, G. G. (2007). Bi-criteria scheduling of a flowshop manufacturing cell with sequence dependent setup times. European journal of industrial engineering, 1(4), 391-413.

[97] Hidri, L., & Gharbi, A. (2017). New efficient lower bound for the Hybrid Flow Shop Scheduling Problem with Multiprocessor Tasks. IEEE access, 5, 6121-6133.

[98] Hosseini, S. M. H. (2016). Modeling the hybrid flow shop scheduling problem followed by an assembly stage considering aging effects and preventive maintenance activities. International Journal of Supply and Operations management, 3(1), 1215-1233.

[99] Javadian, N., Amiri-Aref, M., Hadighi, A., Kazemi, M., & Moradi, A. (2010). Flexible flow shop with sequence-dependent setup times and machine availability constraints. International Journal of management science and engineering management, 5(3), 219-226.

[100] Javadian, N., Fattahi, P., Farahmand-Mehr, M., Amiri-Aref, M., & Kazemi, M. (2012). An immune algorithm for hybrid flow shop scheduling problem with time lags and sequence-dependent setup times. The international journal of advanced manufacturing technology, 63(1), 337-348.

[101] Jin, Z., Ohno, K., Ito, T., & Elmaghraby, S. (2002). Scheduling hybrid flowshops in printed circuit board assembly lines. Production and operations management, 11(2), 216-230.

[102] Johnson, S. M. (1954) Optimal two‐and three‐stage production schedules with setup times included. Naval research logistics (NRL), 1(1), 61-68.

[103] Jolai, F., Sheikh, S., Rabbani, M., & Karimi, B. (2009). A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection. The Int. J. of Ad. Man. Tech, 42(5), 523-532.

[104] Jolai, F., Rabiee, M., & Asefi, H. (2012). A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times. Int. J.of Prod. Res. 50(24), 7447-7466.

[105] Juan, A. A., Lourenço, H. R., Mateo, M., Luo, R., & Castella, Q. (2014). Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues. International transactions in operational research, 21(1), 103-126.

[106] Jungwattanaki, J., Reodecha, M., Chaovalitwongse, P., & Werner, F. (2005). An evaluation of sequencing heuristics for flexible flowshop scheduling problems with unrelated parallel machines and dual criteria. Otto-von-guericke-universitat magdeburg, 28(05), 1-23.

[107] Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., & Werner, F. (2006). Sequencing algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. INTAS

[108] Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., & Werner, F. (2008). Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. The international journal of advanced manufacturing technology, 37(3-4), 354-370.

[110] Kangarloo, N., Rezaeian, J., & Khosrawi, X. (2016). JIT scheduling problem on flexible flow shop with machine break down, machine eligibility and setup times. J. of Math. & Com. Sc, 16(1), 50-68.

[111] Karimi, N., Zandieh, M., & Karamooz, H. (2010). Bi-objective group scheduling in hybrid flexible flowshop: a multi-phase approach. Expert systems with applications, 37(6), 4024-4032.

[112] Wang, H. (2005). Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert systems, 22(2), 78-85.

[113] Karmakar, S., & Mahanty, B. (2010). Minimizing makespan for a flexible flow shop scheduling problem in a paint company. Preceding IEOM. Dhaka, Bangladesh.

[114] Kayvanfar, V., Komaki, G. M., Aalaei, A., & Zandieh, M. (2014). Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times. Comp. & Operations Res, 41, 31-43.

[115] Khalili, M., & Tavakkoli-Moghaddam, R. (2012). A multi-objective electromagnetism algorithm for a bi-objective flowshop scheduling problem. Journal of manufacturing systems, 31(2), 232-239.

[116] Khalili, M., & Naderi, B. (2015). A bi-objective imperialist competitive algorithm for no-wait flexible flow lines with sequence dependent setup times. The Int. J. of Ad. Man. Tech, 76(1-4), 461-469.

[117] Kia, H, Davoudpour, H, Zandieh, M. (2010). Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis. Int. J. of Production Res. 48(14): 4019-4042.

[118] Kia, H., Ghodsypour, SH., Davoudpour, H. (2017). New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times. J. of Industrial Eng. Int. 1-10.

[119] Kianfar, K., Ghomi, S. M. T., & Jadid, A. O. (2012). Study of stochastic sequence-dependent flexible flow shop via developing a dispatching rule and a hybrid GA. Eng. Appl. of Artificial Intel, 25(3), 494-506.

[120] Komaki, M., Sheikh, S., Teymourian, E., & Malakooti, B. (2015). Cuckoo search algorithm for hybrid flow shop scheduling problem with multi-layer assembly operations. International conference on operations excellence and service engineering. Orlando, Florida, USA.

[121] Komaki, M., & Malakooti, B. (2017). General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem. Prod. Eng. 11(3), 1-15.

[122] Kumar, A., & Dhingra, A. (2010). Minimization of total weighted tardiness and makespan for SDST flow shop scheduling using genetic algorithm. Int. J. of Applied Engineering Res, 3(2), 483-494.

[123] Kurz, M. E. (2001). Scheduling flexible flow lines with sequence dependent setup Times. A Dissertation (Doctoral thesis, University of Arizona, USA).

[124] Kurz, M. E., & Askin, R. G. (2003). Comparing scheduling rules for flexible flow lines. International journal of production economics, 85(3), 371-388.

[125] Kurz, M. E., & Askin, R. G. (2004). Scheduling flexible flow lines with sequence-dependent setup times. European journal of operational research, 159(1), 66-82.

[126] Lee, S. M., & Asllani, A. A. (2004). Job scheduling with dual criteria and sequence-dependent setups: mathematical versus genetic programming. Omega, 32(2), 145-153.

[127] Lee, G. C., Hong, J. M., & Choi, S. H. (2015). Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times. Mathematical Problems in Eng.

[128] Lee, J. Y., & Bang, J. Y. (2016). A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness. Mathematical problems in engineering.

[129] Li, L, Wang, L, Huo, J.(2010). Hybrid flowshop scheduling with setup times for cold treating process in Baoshan Iron & Steel Complex. Int. Conference on Logistics Sys. and Intelligent Management.

[130] Li, X., & Li, M. (2015). Multiobjective local search algorithm-based decomposition for multiobjective permutation flow shop scheduling problem. IEEE Trans. on Eng. Manag, 62(4), 544-557.

[131] Li, X., Ma, S (2016) Multi-objective memetic search algorithm for multi-objective permutation flow shop scheduling problem. IEEE access,4, 2154-2165.

[132] Li, X, & Ma, S. (2017). Multiobjective discrete artificial bee colony algorithm for multiobjective permutation flow shop scheduling problem with sequence dependent setup times. IEEE Trans. on Eng. Manag, 64(2), 149-165.

[133] Lin, H. T., & Liao, C. J. (2003). A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International journal of production economics, 86(2), 133-143.

[134] Lin, S. W., & Ying, K. C. (2012). Scheduling a bi-criteria flowshop manufacturing cell with sequence-dependent family setup times. European journal of industrial engineering, 6(4), 474-496.

[135] Liou, C. D., & Hsieh, Y. C. (2015). A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times. Int. J. of Prod. Eco, 170, 258-267.

[136] Liu, C. Y., & Chang, S. C. (2000). Scheduling flexible flow shops with sequence-dependent setup effects. IEEE transactions on robotics and automation, 16(4), 408-419.

[137] Lu, D., & Logendran, R. (2013). Bi-criteria group scheduling with sequence-dependent setup time in a flow shop. Journal of the operational research society, 64(4), 530-546.

[138] Lu, C., Xiao, S., Li, X., & Gao, L. (2016). An effective multi-objective discrete grey wolf optimizer for a real-world scheduling problem in welding production. Advances in Eng. Soft, 99, 161-176.

[139] Lu, C., Gao, L., Li, X., Pan, Q.K., & Wang, Q. (2017a). Energy-efficient permutation flow shop scheduling problem using a hybrid multi-objective backtracking search algorithm. J. of Cleaner Production, 144, 228-238.

[140] Lu, C., Gao, L., Li, X., & Xiao, S. (2017b). A hybrid multi-objective grey wolf optimizer for dynamic scheduling in a real-world welding industry. Eng. Appl.of Artificial Intelligence, 57, 61-79.

[141] Luo, H., Huang, G. Q., Zhang, Y., Dai, Q., & Chen, X. (2009). Two-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithm. Robotics and computer-integrated manufacturing, 25(6), 962-971.

[142] Luo, H., Zhang, A., & Huang, G. Q. (2015). Active scheduling for hybrid flowshop with family setup time and inconsistent family formation. Journal of intelligent manufacturing, 26(1), 169-187.

[143] Lv, Y., Zhang, J., & Qin, W. (2017.) A genetic regulatory network-based method for dynamic hybrid flow shop scheduling with uncertain processing times. Applied sciences, 7(1), 23-42.

[145] Majazi Dalfard, V., Ardakani, A., & Banihashemi, T. N. S. (2011). Hybrid genetic algorithm for assembly flow-shop scheduling problem with sequence-dependent setup and transportation times. The. Vjesnik, 18(4), 497-504.

[146] Maleki-Darounkolaei, A., Modiri, M., Tavakkoli-Moghaddam, R., & Seyyedi, I. (2012). A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times. Journal of industrial engineering international, 8(1), 26.

[147] Maleki-Daronkolaei, A., & Seyedi, I. (2013). Taguchi method for three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times. J. of Eng. Sc.and Tech, 8(5), 603-622.

[148] Mansouri, S. A., Hendizadeh, S. H., & Salmasi, N. (2009). Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times. The Int. J. of Ad. Man.Tech, 40(11), 1216-1226.

[149] Mastrolilli, M., & Svensson, O. (2011). Hardness of approximating flow and job shop scheduling problems. Journal of the ACM(JACM), 58(5),1-32.

[150] Mehravaran, Y., & Logendran, R. (2012). Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times. Int. Journal of Production Economics, 135(2), 953-963.

[151] Meshkinfam, S., Ghassemi, Tari F. (2016). A genetic algorithm for generalized tardiness flowshop problems. International journal of engineering science and technology, 8(9), 219-228.

[152] Michalewicz, Z. (1996). Heuristic methods for evolutionary computation techniques. Journal of heuristics, 1(2), 177-206.

[153] Miettinen, K., Mäkelä, M. M., & Kaario, K. (2006). Experiments with classification-based scalarizing functions in interactive multiobjective optimization. Eur. J. of Operational Res, 175(2), 931-947.

[154] Miettinen, K., Molina, J., González, M., Hernández-Díaz, A., & Caballero, R. (2009). Using box indices in supporting comparison in multiobjective optimization. Eur. J. of Operational Res, 197(1), 17-24.

[155] Minella, G., Ruiz, R., & Ciavotta, M. (2011). Restarted iterated pareto greedy algorithm for multi-objective flowshop scheduling problems. Computers & operations research, 38(11), 1521-1533.

[156] Mirsanei, H., Zandieh, M., Moayed, M. J., & Khabbazi, M. R. (2011). A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times. J. of Int. Manuf, 22(6), 965-978.

[158] Hansen, P., Oğuz, C., & Mladenović, N. (2008). Variable neighborhood search for minimum cost berth allocation. European journal of operational research, 191(3), 636-649.

[159] Mohammadi, G. (2015). Multi-objective flow shop production scheduling via robust genetic algorithms optimization technique. Int. J. of Service Sci., Manag. & Eng, 2(1), 1-8.

[160] Mousavi, S., Zandieh, M., & Amiri, M. (2011). An efficient bi-objective heuristic for scheduling of hybrid flow shops. The Int. Journal of Advanced Manufacturing Technology, 54(1), 287-307.

[161] Mousavi, S., Zandieh, M., & Amiri, M. (2012). Comparisons of bi-objective genetic algorithms for hybrid flowshop scheduling with sequence-dependent setup times. Int. J. of Prod. Res, 50(10), 2570-2591.

[162] Mousavi, S., & Zandieh, M. (2016). An Efficient Hybrid Algorithm for a Bi-objectives Hybrid Flow Shop Scheduling. Intelligent automation & soft computing, 1-8.

[163] Mousavi, S., Mahdavi, I., Rezaeian, J., & Zandieh, M. (2016). An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times. Operational research, 1-36.

[164] 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.

[165] Mozdgir, A., Fatemi Ghomi, S. M. T., Jolai, F., & Navaei, J. (2013). Two-stage assembly flow-shop scheduling problem with non-identical assembly machines considering setup times. Int. J. of Prod. Res, 51(12), 3625-3642.

[166] Naderi, B., Khalili, M., Taghavifard, M., & Roshanaei, V. (2008). A variable neighborhood search for hybrid flexible flowshops with setup times minimizing total completion time. J. of Appl. Sci, 8(16), 2843-2850.

[167] Naderi, B., Zandieh, M., & Fatemi Ghomi, S. M. T. (2009d). A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling. J. of Intelligent Manuf, 20(6), 683-694.

[168] Naderi, B., Zandieh, M., Fatemi Ghomi, S. M. T. (2009c). An iterated greedy algorithm for flexible flow lines with sequence dependent setup times to minimize total weighted completion time. Journal of optimization in industrial engineering, 2(3), 33-37.

[169] Naderi, B., Zandieh, M., Balagh, A. K. G., & Roshanaei, V. (2009b). An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert systems with applications, 36(6), 9625-9633.

[170] Naderi, B., Zandieh, M., & Roshanaei, V. (2009a). Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness. The Int. J. of Ad. Manf.Tech, 41(11-12), 1186-1198.

[171] Naderi, B., Ruiz, R., & Zandieh, M. (2010). Algorithms for a realistic variant of flowshop scheduling. Computers & operations research, 37(2), 236-246.

[173] Nawaz, M., Enscore, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91-95.

[174] Nayak A., Fang K., & Lee S. (2017). Demand response in flow shop with job due dates using genetic algorithm approach. Smart and Sustainable Manufacturing Systems 1(1), 100-120.

[175] Nejati, M., Mahdavi, I., Hassanzadeh, R., & Mahdavi-Amiri, N. (2016). Lot streaming in a two-stage assembly hybrid flow shop scheduling problem with a work shift constraint. J. of Ind. & Prod. Eng, 33(7), 459-471.

[176] Pan, Q. K., Gao, L., Li X. Y., & Gao, K. Z. (2017). Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times. Appl. Mathematics and Comp, 303, 89-112.

[177] Panahi, H. (2014). Two-stage flexible flow shop scheduling with blocking constraint and batching machines (Doctoral thesis, Oregon State University, Oregon, USA).

[178] Palmer, D. (1965). Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum. J. of the Operational Res. Society, 16(1), 101-107.

[179] Patnaik, S., Yang, X. S., & Nakamatsu, K. (2017). Nature-inspired computing and optimization: theory and applications, Vol. 10. Springer International Publishing.

[180] Pargar, F., & Zandieh, M. (2012). Bi-criteria SDST hybrid flow shop scheduling with learning effect of setup times: water flow-like algorithm approach. Int. J. of Prod. Res, 50(10), 2609-2623.

[181] Parveen, S., & Ullah, H. (2011). Review on job-shop and flow-shop scheduling using multi criteria decision making. Journal of mechanical engineering, 41(2), 130-146.

[182] Pearn, W., Chung, S., Yang, M., & Chen, C. (2005). The integrated circuit packaging scheduling problem (icpsp): A case study. Int. J. of Industrial Eng.-Theory Appl. and Practice 12(3), 296-307.

[184] Ponnambalam, S., Jagannathan, H., Kataria, M., & Gadicherla, A. (2004) A TSP-GA multi-objective algorithm for flow-shop scheduling. The Int J. of Advanced Manuf. Tech, 23(11-12), 909-915.

[185] Qian, B., Wang, L., Huang, D. X., Wang, W. I., & Wang, X. (2009) An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Comp. & Op. Res, 36(1), 209-233.

[186] Rabiee, M., Rad, R. S., Mazinani, M., & Shafaei, R. (2014). An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines. The Int. J. of Ad. Man. Tech, 71(5-8), 1229-1245.

[187] Rahimi-Vahed, A., & Mirzaei, A. H. (2007). A hybrid multi-objective shuffled frog-leaping algorithm for a mixed-model assembly line sequencing problem. Comp. & Industrial Eng, 53(4), 642-666.

[188] Rahmanidoust, M., Zheng, J., & Rabiee, M. (2017). Simultaneous considering of machine availability constraint, sequence dependent setup time and ready time in a no-wait hybrid flow shop scheduling problem to minimize mean tardiness. International journal of computer applications, 169(7), 30-37.

[189] 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. Industrial and systems engineering, 8(2), 67-85.

[190] Ramezani, P., Rabiee, M., & Jolai, F. (2015). No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach. J. of Int. Man, 26(4), 731-744.

[191] Ramezanian, R., Aryanezhad, M., & Heydari M. (2010). A mathematical programming model for flow shop scheduling problems for considering just in time production. Int. J. of Industrial Eng, 21(2), 97-104.

[192] Ramezanian, R., Fallah Sanami, S., & Mahmoodian, V. (2017). A new mathematical model for integrated production planning and scheduling problem in capacitated flexible flow shop with sequence-dependent setups. Scientia iranica, 24(5), 2501-2514.

[193] Rashidi, E., Jahandar, M., & Zandieh, M. (2010). An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines. The Int. J. of Ad. Manuf. Tech, 49(9), 1129-1139.

[194] Rezaeian, J., Seidgar, H., & Kiani, M. (2013). Scheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms. J. of Opt. in Ind. Eng, 6(13), 1-11.

[195] Ribas, I., Companys, R., & Tort-Martorell, X. (2017). Efficient heuristics for the parallel blocking flow shop scheduling problem. Expert systems with applications, 74, 41-54.

[196] Ruiz, R., & Maroto, C. (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European journal of operational research, 169(3), 781-800.

[197] Ruiz, R., Şerifoğlu, F. S., & Urlings, T. (2008). Modeling realistic hybrid flexible flowshop scheduling problems. Computers & operations research, 35(4), 1151-1175.

[198] Saluja, V., & Jain, A. (2014). Optimization of flexible flow shop scheduling with sequence dependent setup time and lot splitting. 5th international & 26th all india manufacturing technology, design and research conference. IIT Guwahati, Assam, India

[199] Samarghandi, H., & Behroozi, M. (2017). On the exact solution of the no-wait flow shop problem with due date constraints. Computers & operations research, 81, 141-159.

[200] Saravanan, M., Vijayakumar, S. J. D., & Srinivasan, R. (2014). A multicriteria permutation flowshop scheduling problem with setup times. Int. J. of Eng. and Tech, 6(3), 1329-1339.

[201] Satyanarayana, D., & Pramiladevi, M. (2016). Multi-criteria m-machine SDST flow shop scheduling using modified heuristic genetic algorithm. Int. J. of Industrial and Sys. Eng, 22(4), 409-422.

[202] Satyanarayana, D., & Pramiladevi, M. (2017). Special heuristics for flowshop scheduling based on hybrid genetic algorithm under SDST environment. Int. J. of Mech. Eng. & Tech, 8(4), 327-336.

[203] Seidgar, H., Ezzati, M., Kiani, M., & Tavakkoli-Moghaddam, R. (2013). An efficient genetic algorithm for two-stage hybrid flow shop scheduling with preemption and sequence dependent setup time. Journal of mathematics and computer science, 6, 251 – 259.

[204] Seidgar, H., Abedi, M., & Rad, S. T. (2015). A new mathematical model for scheduling flexible flow shop problem with learning and forgetting effects of workers. Int. J.of Industrial and Sys. Eng, 21(4), 534-549.

[205] Seyedi, I., Maleki-Daronkolaei, A., & Kalashi, F. (2012). Tabu search and simulated annealing for new three-stage assembly flow shop scheduling with blocking. Int. J. of Cont. Res. In Business, 4(8), 394-402.

[206] Shabtay, D., & Oron, D. (2016). Proportionate flow-shop scheduling with rejection. Journal of the operational research society, 67(5), 752-769.

[207] Shahvari, O., Salmasi, N., & Logendran, R. (2009). A meta-heuristic algorithm for flexible flow shop sequence dependent group scheduling problem. Proceedings of the 2009 Int. Conf. on Value Chain Sustainability. Kentucky, USA.

[208] Sharma, S., Gupta, D., & Nailwal, K. K. (2017a). Bi-criteria multistage flow shop scheduling with sequence-dependent setup times. International journal of operational research, 29(1), 127-147.

[209] Sharma, S., Gupta, D., & Nailwal, K. K. (2017b). Sequence dependent flow shop scheduling with job block criteria. Global journal of pure and applied mathematics, 13(5), 1401-1414.

[210] Sheikh, S., Komaki, M., Teymourian, E., & Malakooti, B. (2015). Multi-objective non-permutation flowshop with dependent setup times and missing operations. 7th Int. Joint Conf. on Comp. Intel. (IJCCI).

[211] Sioud, A., Gagné, C., & Gravel, M. (2014a). Metaheuristics for solving a hybrid flexible flowshop problem with sequence-dependent setup times. 1st international conference on swarm intelligence based optimization, first international conference, ICSIBO. Mulhouse, France.

[212] Sioud, A., Gagné, C., & Gravel, M. (2014). Minimizing total tardiness in a hybrid flexible flowshop with sequence dependent setup times. The fourth international conference on advanced communications and computation. Paris, France.

[213] Sioud, A., Gagné, C., & Dort, J. (2015). A GISMOO algorithm for a multi-objective permutation flowshop with sequence-dependent setup times. 7th international joint conference on computational intelligence. Lisbon, Portugal.

[214] Sivapragasam, S., & Suppiah, Y. (2017). Minimizing Total Weighted Tardiness in Identical Parallel Machine with Sequence Dependent Setup Time Using Genetic Algorithm. Journal of telecommunication, electronic and computer engineering (JTEC), 9(1-4), 89-93.

[215] Song, J., Tang, J., Luo, X., & Liu, S. (2008). Scheduling model and heuristic algorithm for roller annealing. Chinese controland decision conference, CCDC (pp. 1052-1055).

[216] Sukkerd, W., & Wuttipornpun, T. (2017). Non-population search algorithms for capacitated material Requirement Planning in multi-stage assembly flow shop with alternative machines. World academy of science, engineering and technology, Int. J. of Mech., Aer., Ind., Mech. and Man. Eng, 11(3), 636-643.

[217] Tabrizi, A. A., Zandieh, M., & Vaziri, Z. (2009). A novel simulated annealing algorithm to hybrid flow shops scheduling with sequence-dependent setup times. J. of Applied Sciences, 9(10), 1943-1949.

[218] Tang, J., & Song, J. (2010). Discrete particle swarm optimization combined with no-wait algorithm in stages for scheduling mill roller annealing process. International journal of computer integrated manufacturing, 23 (11), 979-991.

[219] Tao, W., & Rongqiu, C. (2006). Heuristic algorithm of scheduling model for cold coils annealing. Proceedings of the world congress on intelligent control and automation (WCICA) (pp. 7263-7266).

[220] Tavakkoli-Moghaddam R., & Safaei, N. (2007). A new mathematical model for flexible flow lines with blocking processor and sequence-dependent setup time. Multiprocessor scheduling, theory and applications: I-Tech education and publishing. Vienna, Austria 2007, 266–283.

[221] Tavakkoli-Moghaddam, R., Rahimi-Vahed, A., & Mirzaei, A.H. (2007). A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Information sciences, 177(22), 5072-5090.

[222] Tavakkoli-Moghaddam, R., Azarkish, M., & Sadeghnejad-Barkousaraie, A. (2011). A new hybrid multi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling problem. Expert Sys. with Appl, 38(9), 10812-10821.

[223] Tavakkoli-Moghaddam, R., & Amin-Tahmasbi, H. (2012). A multi-objective immune system for a new bi-objective permutation flowshop problem with sequence-dependent setup times. Iranian journal of operations research, 3(2), 66-82.

[224] Taillard, E. (1993) Benchmarks for basic scheduling problems. European journal of operational research, 64(2), 278-285.

[225] Tian, H., Li, K., & Liu, W. (2016). A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time. Math. Pro. in Eng.

[226] Tyaghi, N., Seidgar, H., Abedi, M., & Chandramouli, A. B. (2014). Learning and forgetting effects of flexible flow shop scheduling. International journal of innovation and applied studies, 7(3), 857-867.

[227] Urlings, T., Ruiz, R., & Serifoglu, F. S. (2010). Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems. International journal of metaheuristics, 1(1), 30-54.

[228] Vanchipura, R., Sridharan, R., & Babu, A. S. (2014). Improvement of constructive heuristics using variable neighbourhood descent for scheduling a flow shop with sequence dependent setup time. Journal of manufacturing systems, 33(1), 65-75.

[229] Wang, H. S., Wang, L. C., Chen, T. L., Chen, Y. Y., & Cheng, C. Y. (2013a). Multi-stage parallel machines and lot-streaming scheduling problems–a case study for solar cell industry. In Prabhu, V., Taisch, M., & Kiritsis D (Eds). Advances in production management systems (pp. 151-158). Springer, Berlin, Heidelberg.

[230] Wang, I. L., Wang, Y. C., & Chen, C. W. (2013b). Scheduling unrelated parallel machines in semiconductor manufacturing by problem reduction and local search heuristics. Flex. Ser. & Man. J, 25(3), 343-366.

[231] Xiao, J., & Zheng, L. (2010). A MILP-based batch scheduling for two-stage hybrid flowshop with sequence-dependent setups in semiconductor assembly and test manufacturing. IEEE conference on automation science and engineering (pp. 21-24). Toronto, ON, Canada.

[232] Xu, J. Y., Dong, N. Q., & Gu, S. S. (2013). Multi-objective permutation flowshop scheduling with sequence-dependent setup times. Computer integrated manufacturing systems, 19(12).

[233] Xu, Z. H., Li, J. M., & Gu, X. S. (2016). Multi-objective flow shop scheduling problem based on GMOGSO. Control and decision, 31(10), 1772-1778.

[234] Xu, J., Wu, C. C., Yin, Y., & Lin, W. C. (2017). An iterated local search for the multi-objective permutation flowshop scheduling problem with sequence-dependent setup times. Appl. Soft Comp, 52, 39-47.

[235] Yaurima, V., Burtseva, L., & Tchernykh, A. (2009). Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers. Comp. & Ind. Eng, 56(4), 1452-1463.

[236] Yazdani, M., & Naderi, B. (2017). Modeling and scheduling no-idle hybrid flow shop problems. J. of Opt. in Industrial Eng, 10(21), 59-66.

[237] Yokoyama, M. (2001). Hybrid flow-shop scheduling with assembly operations. International journal of production economics, 73(2), 103-116.

[238] Zandieh, M., Fatemi Ghomi, S. M. T., & Husseini, S. M. (2006). An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Appl. Math. and Comp, 180(1), 111-127.

[239] Zandieh, M., & Rashidi, E. (2009). An effective hybrid genetic algorithm for hybrid flow shops with sequence dependent setup times and processor blocking. J. of Industrial Eng, 4(8), 51-58.

[240] Zandieh, M., & Gholami, M. (2009). An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. Int. J. of Prod. Res, 47(24), 6999-7027.

[241] Zandieh, M., Dorri, B., & Khamseh, A. (2009). Robust metaheuristics for group scheduling with sequence-dependent setup times in hybrid flexible flow shops. The Int. J.of Adv. Manuf. Tech, 43(7), 767-778.

[242] Zandieh, M., Mozaffari, E., & Gholami, M. (2010). A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems. Journal of intelligent manufacturing, 21(6), 731-743.

[243] Zandieh, M., & Karimi, N. (2011). An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times. Journal of intelligent manufacturing, 22(6), 979-989.

[244] Zandieh, M., & Hashemi, A. (2015). Group scheduling in hybrid flexible flowshop with sequence-dependent setup times and random breakdowns via integrating genetic algorithm and simulation. International journal of industrial and systems engineering, 21(3), 377-394.