SUPPLY CHAIN MANAGEMENT – ENTERPRISE SYSTEM INTEGRATION AND SUPPLY CHAIN RESOURCE PLANNING

Abstract

Flexible flowshop scheduling problem is a kind of problem that has serial stages, which at least one of them has parallel machines and that jobs follow the same route. It can be considered as flowshop scheduling problem with parallel machines or parallel machine scheduling problem with multi stages. There is not a recent literature review, though there are reviews made in the past. In this study 132 papers on flexible flowshop scheduling problem were sequenced according to publication date, process complexity, scheduling criteria and method(s) used for solution and classified as 2, 3 and multi stages. 

Keywords

• Flexible flowshop scheduling problem,scheduling

ESNEK AKIŞ TİPİ ÇİZELGELEME PROBLEMİ ÜZERİNE LİTERATÜR TARAMASI

Öz

Esnek akış tipi çizelgeleme problemi birbirine seri aşamaları olan, bu aşamalardan en az birinde paralel makineler bulunan ve işlerin aynı rotayı takip ettiği çizelgeleme problemi tipidir. Akış tipi çizelgeleme probleminin paralel makineli hali veya paralel makine çizelgeleme probleminin çok aşamalı hali olarak da düşünülebilir. Bu konuda geçmiş yıllarda yapılmış literatür çalışmaları olmasına rağmen güncel bir literatür taraması bulunmamaktadır. Bu çalışmada esnek akış tipi çizelgeleme problemi üzerine yapılmış 132 çalışma yayınlandıkları yıla, süreç karmaşıklığına, çizelgeleme kriterine ve çözümde kullanılan yöntem(ler)e göre sıralanmış, 2, 3 ve çok aşamalı olarak sınıflandırılmıştır.

Anahtar Kelimeler

• Esnek akış tipi çizelgeleme problemi,çizelgeleme

Kaynakça

1. Adler, L., Fraiman, N., Kobacker, E., Pinedo, M., Plotnicoff, J.C. and Wu, T.P. (1993). BPSS: A scheduling support system for packing industry, Operations Research, 41(4), 641-648.
2. Adressi, A., Hassanpour, S., & Azizi, V. (2016). Solving group scheduling problem in no-wait flexible flowshop with random machine breakdown. Decision Science Letters, 5(1), 157-168.
3. Agnetis, A., A. Pacifici, F. Rossi, M. Lucertini, S. Nicoletti, F. Nicolo, G. Oriolo, D. Pacciarelli and E. Pesaro. (1997). Scheduling of flexible flow lines in an automobile assembly plant, European Journal of Operational Research, 97, 348-362.
4. Ahonen, H., & de Alvarenga, A. G. (2017). Scheduling flexible flow shop with recirculation and machine sequence-dependent processing times: formulation and solution procedures. The International Journal of Advanced Manufacturing Technology, 89(1-4), 765-777.
5. Akrami, B., B. Karimi and S.M.M. Hosseini. (2006). Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: The finite horizon case, Applied Mathematics & Computation, 183, 634-645.
6. Alisantoso, D., L.P. Khoo and P.Y. Jiang. (2003). “An immune algorithm approach to the scheduling of a flexible PCB flow shop”, International Journal of Advanced Manufacturing Technologies, 22, 819-827.
7. Allaoui, H. and A. Artiba. (2006). “Scheduling two-stage hybrid flow shop with availability constraints”, Computers & Operations Research, 33, 1399-1419.
8. Amin-Naseri, M.R. and M.A. Beheshti-Nia. (2009). “Hybrid flow shop scheduling with parallel batching”, International Journal of Production Economics, 117, 185-196.

9. Arthanary, T.S. and K.G. Ramaswamy (1971), An extension of two machines sequencing problem, Opsearch, 8, 10-22.
10. Asefi, H.; F. Jolahi, M. Rabiee, M.E. Tayebi Araghi (2014). “A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem”, The International Journal of Advanced Manufacturing Technology,
11. Attar, S. F., Mohammadi, M., & Tavakkoli-Moghaddam, R. (2013). Hybrid flexible flowshop scheduling problem with unrelated parallel machines and limited waiting times. The International Journal of Advanced Manufacturing Technology, 68(5-8), 1583-1599.
12. Azizoğlu, M., E. Çakmak and S. Kondakci. (2001). “A flexible flowshop problem with total flow time minimization”, European Journal of Operational Research, 132, 528-538.
13. Baker, K.R. and D. Trietsch. (2009). Principles of Sequencing and Scheduling. New Jersey: Wiley.
14. Behnamian, J., S.M.T. Fatemi Ghomi and M. Zandieh. (2009). “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, 11057-11069.
15. Behnamian, J., S.M.T. Fatemi Ghomi. (2011). “Hybrid flowshop scheduling with machine and resource-dependent processing times”, Applied Mathematical Modelling, 35, 1107-1123.
16. Behnamian, J. and M. Zandieh. (2011). “A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties”, Expert Systems with Applications, 38, 14490-14498.
17. Botta-Genoulaz, V. (2000). “Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness”, International Journal of Production Economics, 64, 101-111.
18. Brah, S.A. and J.L. Hunsucker. (1991). “Branch and bound algorithm for the flow shop with multiple processors”, European Journal of Operational Research, 51, 88-99.
19. Brah, S.A. and L.L. Loo. (1999). “Heuristics for scheduling in a flow shop with multiple processors”, European Journal of Operational Research, 113, 113-122.
20. Caricato, P., A. Grieco and D. Serino. (2007). “Tsp-based scheduling in a batch-wise hybrid flow-shop”, Robotics & Computer-Integrated Manufacturing, 23, 234-241.
21. Carlier, J. and E. Neron. (2000). “An exact method for solving the multi-processor flow-shop”, RAIRO Operations Research, 34, 1-25.
22. Carpov, S., J. Carlier, D. Nace and R. Sirdey. (2012). “Two-stage hybrid flow shop with precedence sonstraints and parallel machines at second stage”, Computers & Operations Research, 39, 736-745.
23. Chen, B. (1995). “Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage”, Journal of Operations Research Society, 46, 234-244.
24. Chang, S. and D. Liao. (1994). “Scheduling flexible flow shops with no setup effects”, IEEE Transactions on Robotics & Automation, 10(2), 112-122
25. Cheng, J., Y. Karuno and H. Kise. (2001). “A shifting bottleneck approach for a parallel-machine flowshop scheduling problem”, Journal of the Operations Research Society of Japan, 44(2), 140-156.
26. Choi, H. and D. Lee. (2009). “Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops”, Computers & Industrial Engineering, 56, 113-120.
27. Choong, F., S. Phon-Amnuaisuk and M.Y. Alias. (2011). “Metaheuristic methods in hybrid flow shop scheduling problem”, Expert Systems with Applications, 38, 10787-10793.
28. Crowder, B. (2006). Minimizing the Makespan in a Flexible Flowshop with Sequence Dependent Setup Times, Uniform Machines, and Limited Buffers, Thesis of Master of Science in Industrial Engineering, College of Engineering and Mineral Resources, West Virginia University. West Virginia
29. Dai, M., Tang, D., Giret, A., Salido, M. A., & Li, W. D. (2013). Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm. Robotics and Computer-Integrated Manufacturing, 29(5), 418-429.
30. Ding, F. and D. Kitticharttphayak. (1994). “Heuristics for scheduling flexible flow lines”, Computers & Industrial Engineering, 26(1), 27-34.
31. Engin, O. and A. Döyen. (2004). “A new approach to solve hybrid flow shop scheduling problems by artificial immune system”, Future Generation Computer Systems, 20, 1083-1095.
32. Figielska, E. (2009). “A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources”, Computers & Industrial Engineering, 56, 142-151.
33. French, S. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Chichester, UK, Ellis Horwood.
34. Gicquel, C., L. Hege, M. Minoux and W. Canneyt. (2012). “A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints”, Computers & Operations Research, 39, 629-636.
35. Guinet, A.G.P. and M.M. Solomon (1996). “Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time”, International Journal of Production Research, 34(6), 1643-1654.
36. Guinet, A., M.M. Solomon, P.K. Kedia and A. Dussauchoy. (1996). “A computational study of heuristics for two-stage flexible flowshops”, International Journal of Production Research, 34(5), 1399-1415.
37. Gupta, J.N.D. (1988). “Two-stage, hybrid flowshop scheduling problem”, The Journal of Operational Research Society, 39(4), 359-364.
38. Gupta, J.N.D. and E.A. Tunc. (1991). “Schedules for a two-stage hynrid flowshop with parallel machines at the second stage”, International Journal of Production Research, 29(7), 1489-1502.
39. Gupta, J.N.D. and E.A. Tunc. (1994). “Scheduling a two-stage hybrid flowshop with seperable setup and removal times”, European Journal of Operational Research, 77, 415-428.
40. Gupta, J.N.D., A.M.A. Hariri and C.N. Potts. (1997). “Scheduling a two-stage hybrid flow shop with parallel machines at the first stage”, Annals of Operations Research, 69, 171-191.
41. Gupta, J.N.D., K. Krüger, V. Lauff, F. Werner and Y.N. Sotskov. (2002). “Heuristics for hybrid flow shops with controllable processing times and assignable due dates”, Computers & Operations Research, 29, 1417-1439.
42. Haouari, M., L. Hidri and A. Gharbi. (2006). “Optimal scheduling of a two-stage hybrid flow shop”, Mathematical Methods of Operations Research, 64, 107-124.
43. Hidri, L. and M. Haouari. (2011). “Bounding strategies for the hybrid flow shop scheduling problem”, Applied Mathematics & Computation, 217, 8248-8263.
44. Hmida, A.B, M. Haouari, M. Huguet and P. Lopez. (2011). “Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search”, Computers & Industrial Engineering, 60, 320-327.
45. Hoogeveen, J.A., J.K. Lenstra and B. Veltman. (1996). “Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard”, European Journal of Operational Research, 89, 172-175.
46. Huang, W. and S. Li. (1998). “A two-stage hybrid flowshop with uniform machines and setup times”, Mathematical & Computer Modelling, 27(2), 27-45.
47. Hunsucker, J.L. and J.R. Shah. (1994). “Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment”, European Journal of Operational Research, 72, 102-114.
48. Janiak, A., E. Kozan, M. Lichtenstein and C. Oğuz. (2007). “Metaheuristic approach to the hybrid flow shop scheduling problem with a cost-related criterion”, International Journal of Production Economics, 105, 407-424.
49. Jayamohan, M.S. and C. Rajendran. (2000). “A comparative analysis of two different approaches to scheduling in flexible flow shops”, Production Planning & Control, 11(6), 572-580.
50. Jenabi, M., S.M.T. Fatemi Ghomi, S.A. Torabi and B. Karimi. (2007). “Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines”, Applied Mathematics & Computation, 186, 230-245.
51. Jin, Z.H., K. Ohno, T. Ito and S.E. Elmaghraby. (2002). “Scheduling hybrid flowshops in printed circuit board assembly lines”, Production and Operations Management, 11(2), 216-230.
52. Jolai, F., Asefi, H., Rabiee, M., & Ramezani, P. (2013). Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem. Scientia Iranica, 20(3), 861-872.
53. Jolai, F., Tavakkoli-Moghaddam, R., Rabiee, M., & Gheisariha, E. (2014). An enhanced invasive weed optimization for makespan minimization in a flexible flowshop scheduling problem. Scientia Iranica. Transaction E, Industrial Engineering, 21(3), 1007.
54. Jouglet, A., C. Oğuz and M. Sevaux. (2009). “Hybrid flow-shop: A memetic algorithm using constraint-based scheduling for efficient search”, Journal of Mathematical Modelling & Algorithms, 8, 271-292.
55. Jungwattanakit, J., M. Reodecha, P. Chaovalitwongse and F. Werner. (2009). “A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times and dual criteria”, Computers & Operations Research, 36, 358-378.
56. Karimi, N., M. Zandieh and R. Kar-Amooz. (2009). “Bi-objective group scheduling in hybrid flexible flowshop: A multi-phase approach”, Expert Systems with Applications, 37(6), 4024-4032.
57. Keshavarz, T., Salmasi, N., & Varmazyar, M. (2015). Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem. Annals of Operations Research, 226(1), 351-377.
58. Kim, Y., B. Joo and J. Shin. (2009). “Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product mix ratio constraint”, Journal of Heuristisc, 15, 19-42.
59. Kis, T. and E. Pesch. (2005). “A review of exact solution methods for the non-preemptive multiprocessor flowshop problem”, European Journal of Operational Research, 164, 592-608.
60. Khalouli, S., F. Ghedjati and A. Hamzaoui. (2010). “A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop”, Engineerign Applications of Artificial Intelligence, 23, 765-771.
61. Kochhar, S. and R.J.T. Morris. (1987). “Heuristic methods for flexible flow line scheduling”, Journal of Manufacturing Systems, 6(4), 299-314.
62. Koulamas C. and G.J. Kyparisis. (2000). “Asymtotically optimal linear time algorithms for two-stage and three-stage flexible flow shops”, Naval Research Logistics, 47(3), 259-268.
63. Kurz, M.E. and R.G. Askin. (2003). “Comparing scheduling rules for flexible flow lines”, International Journal of Production Economics, 85, 371-388.
64. Kurz, M.E. and R.G. Askin. (2004). “Scheduling flexible flow lines with sequence-dependent setup times”, European Journal of Operational Research, 159, 66-82.
65. Kyparisis, G.J. and C. Koulamas. (2001). “A note on weighted comptetion time minimization in a flexible flow shop”, Operations Research Letters, 29, 5-11.
66. Kyparisis, G.J. and C. Koulamas. (2006a). “Flexible flow shop scheduling with uniform parallel machines”, European Journal of Operational Research, 168, 985-997.
67. Kyparisis, G.J., and C. Koulamas. (2006b). “A note on makespan minimization in two-stage flexible flowshops with uniform machines”, European Journal of Operational Research, 175, 1321-1327.
68. Lee, C. and G.L. Vairaktarakis. (1994). “Minimizing makespan in hybrid flowshops”, Operations Research Letters, 16, 149-158.
69. Lee, C. and G.L. Vairaktarakis. (1998). “Performance comparison of some classes of flexible flow shops and job shops”, The International Journal of Flexible Mnufacturing Systems, 10, 379-405.
70. Li, S. (1997). “A hybrid two-stage flowshop with part family, batch production, major and minor setups”, European Journal of Operational Research, 102, 142-156.
71. 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.
72. Liao, C. J., Tjandradjaja, E., & Chung, T. P. (2012). An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem. Applied Soft Computing, 12(6), 1755-1764.
73. Lin, H. and C. Liao, (2003). “A case study in a two-stage hybrid flow shop with setup time and dedicated machines”, International Journal of Production Economics, 86, 133-143.
74. Lin, J. T., & Chen, C. M. (2015). Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing. Simulation Modelling Practice and Theory, 51, 100-114.
75. Linn, R. and W. Zhang, (1999). “Hybrid Flow Shop Scheduling: A Survey”, Computers & Industrial Engineering, 37, 57-61.
76. Liu, C. and S. Chang, (2000). “Scheduling flexible flow shops with sequence-dependent setup effects”, IEEE Transactions on Robotics & Automation, 16(4), 408-419.
77. Logendran, R., S. Carson and E. Hanson. (2005). “Group scheduling in flexible flow shops”, International Journal of Production Economics, 96, 143-155.
78. Logendran, R., P. deSzoeke and F. Barnard. (2006). “Sequence-dependent group scheduling problems in flexible flow shops”, International Journal of Production Economics, 102, 66-86. Luss, H. and M.B. Rosenwein. (1993). A due date assignment algorithm for multiproduct manufacturing facilities, European Journal of Operational Research, 65, 187-198.
79. Marichelvam, M. K., Prabaharan, T., & Yang, X. S. (2014). A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems. IEEE transactions on evolutionary computation, 18(2), 301-305.
80. Mirabi, M., Ghomi, S. F., & Jolai, F. (2013). A two-stage hybrid flowshop scheduling problem in machine breakdown condition. Journal of Intelligent Manufacturing, 24(1), 193-199.
81. Moursli, O. and Y. Pochet. (2000). “A branch-and-bound algorithm for the hybrid flowshop”, International Journal of Production Economics, 64, 113-125.
82. Naderi, B., : Zandieh and M.A.H.A. Shirazi. (2009). “Modeling and scheduling a case of flexible flowshops: Total weighted tardiness minimization”, Computers & Industrial Engineering, 57(4), 1258-1267.
83. Narasimhan, S.L. and S.S. Panwalkar. (1984). “Scheduling in a two-stage manufacturing process”, International Journal of Production Research, 22(4), 555-564.
84. Narasimhan, S.L. and P.M. Mangiameli. (1987). “A comparison of sequencing rules for a two-stage hybrid flow shop”, Decision Sciences, 18(2), 250-265.
85. Negenman, E.G. (2001). “Local search algorithms for the multiprocessor flow shop scheduling problem”, European Journal of Operational Research, 128, 147-158.
86. Neron, E., P. Baptiste and J.N.D. Gupta. (2001). “Solving hybrid flowshop problem using energetic reasoning and global operations”, Omega The International Journal of Management Science, 29, 501-511.
87. Niu, Q., T. Zhou, M. Fei and B. Wang. (2012). “An efficient quantum immune algorithm to minimize mean flow time for hybrid flow shop problems”, Mathematics & Computers in Simulation, 84, 1-25.
88. Oğuz, C. and M.F. Ercan. (1997). “Scheduling multiprocessor tasks in a two-stage flow-shop environment”, Computers & Industrial Engineering, 33(1-2), 269-272.
89. Oğuz, C. and M.F. Ercan. (2005). “A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks”, Journal of Scheduling, 8, 323-351.
90. Pan, Q. K., Wang, L., Li, J. Q., & Duan, J. H. (2014). A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega, 45, 42-56.
91. Paternina-Arboleda, C.D., J.R. Montoya-Torres, M.J. Acero-Dominguez and M.C. Herrera-Hernandez. (2008). “Scheduling jobs on k-stage flexible flow-shops”, Annals of Operations Research, 164, 29-40.
92. Pinedo, M.L. (2008). Scheduling: Theory, Algorithms and Systems (3rd Ed.). New York: Springer.
93. Portmann, M., A. Vignier, D. Dardilhac and D. Dezalay. (1998). “Branch and bound crossed with GA to solve hybrid flowshops”, European Journal of Operational Research, 107, 389-400.
94. Quadt, D. and H. Kuhn. (2007a). “Batch scheduling of jobs with identical process times on flexible flow lines”, International Journal of Production Economics, 105, 385-401.
95. Quadt, D. and H. Kuhn. (2007b). “A taxonomy of flexible flow line scheduling”, European Journal of Operational Research, 178, 686-698.
96. 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 International Journal of Advanced Manufacturing Technology, 71(5-8), 1229-1245.
97. Rajendran, C. and D. Chaudhuri. (1992a). “A multi-stage parallel processor flowshop problem with minimum flowtime”, European Journal of Operational Research, 57, 111-122.
98. Rajendran, C. and D. Chaudhuri.(1992b). “Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan”, International Journal of Production Economics, 27, 137-143.
99. Randhawa, S.U., C. Jowono and S. Burhanuddin. (1994).”Scheduling in multistage flowshop systems: An application in the food processing industry”, Industrial Management & Data Systems, 94(5), 16-24.
100. Ribas, I., R. Leisten and J.M. Framinan. (2010). “Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective”, Computers & Operations Research, 37, 1439-1454.
101. Ruiz, R. and C. Maroto. (2006). “A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility”, European Journal of Operational Research, 169, 781-800.
102. Ruiz, R., F.S. Şerifoğlu and T. Urlings. (2008). “Modeling realistic hybrid flowshop scheduling problems”, Computers & Operations Research, 35, 1151-1175.
103. Ruiz, R. and J.A. Vazquez-Rodriguez. (2010). “The hybrid flow shop scheduling problem”, European Journal of Operational Research, 205(1), 1-18.
104. Salvador, M. S. (1973). A solution to a special case of flow shop scheduling problems. In Symposium of the Theory of Scheduling and Applications (pp. 83-91). Springer, New York.
105. Santos, D.L., J.L. Hunsucker and D.E. Deal. (1995). “Global lower bounds for flow shops with multiple processors”, European Journal of Operational Research, 80, 112-120.
106. Santos, D.L., J.L. Hunsucker and D.E. Deal. (1996). “An evaluation of sequencing heuristics in flow shops with multiple processors”, Computers & Industrial Engineering, 30(4), 681-692. Sawik, T. (1995). “Scheduling flexible flow lines with no in-process buffers”, International Journal of Production Research, 33(5), 1357-1367.
107. Sawik, T. (2000). “Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers”, Mathematical & Computer Modelling, 31, 39-52.
108. Sawik, T. (2002). “An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers”, Mathematical & Computer Modelling, 36, 461-471.
109. Shiau, D., S. Cheng and Y. Huang. (2008). “Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm”, Expert Systems with Applications, 34, 1133-1143.
110. Soewandi, H. and S.E. Elmaghraby. (2001). “Sequencing three-stage flexible flowshops with identical machines to minimize makespan”, IIE Transactions, 33, 985-993.
111. Soewandi, H. And S.E. Elmaghraby. (2003). “Sequencing on two-stage hybrid flowshops with uniform machines to minimize makespan”, IIE Transactions, 35, 467-477.
112. Sriskandarajah, C. and S.P. Sethi. (1989). “Scheduling algorithms for flexible flowshops: Worst and average case performance”, European Journal of Operational Research, 43, 143-160.
113. Tadayon, B., & Salmasi, N. (2013). A two-criteria objective function flexible flowshop scheduling problem with machine eligibility constraint. The International Journal of Advanced Manufacturing Technology, 1-15.
114. Tang, D., Dai, M., Salido, M. A., & Giret, A. (2016). Energy-efficient dynamic scheduling for a flexible flow shop using an improved particle swarm optimization. Computers in Industry, 81, 82-95.
115. Tavakkoli-Moghaddam, R., N. Safaesi and F. Sassani. (2009). “A memetic algorithm for the flexible flow line scheduling problem with processor blocking”, Computers & Operations Research, 36, 402-414.
116. Tseng, C., C. Liao and T. Liao. (2008). “A note on two-stage hybrid flowshop scheduling with missing operations”, Computers & Industrial Engineering, 54, 605-704.
117. Tsubone, H., M. Ohba, H. Takamuki and Y. Miyake. (1993). “A production scheduling system for a hybrid flow shop – a case study”, Omega International Journal of Management Science, 21(2), 205-214.
118. Tyagi, N., Tripathi, R. P., & Chandramouli, A. B. (2016). Flexible flowshop scheduling model with four stages. Indian Journal of Science and Technology, 9(42).
119. Uetake, T., H. Tsubone and M. Ohba. (1995). “A production scheduling system in a hybrid flow shop”, International Journal of Production Economics, 41, 395-398.
120. Urlings, T., R. Ruiz and T. Stützle. (2010). “Shifting representation search for hybrid flexible flowline problems”, European Journal of Operational Research, 207, 1086-1095.
121. Verma, S. and M. Dessouky. (1999). “Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines”, Journal of Scheduling, 2, 135-150.
122. Vignier, A., J. Billaut, C. Proust and V. T’kindt. (1996). “Resolution of some 2-stage hybrid flowshop scheduling problems”, IEEE International Conference on Systems, Man and Cybernetics, 4, 2934-2941.
123. Vignier, A., D. Dardilhac, D. Dezalay and C. Proust. (1996). “A branch and bound approach to minimize the total completion time in a k-stage hybrid flowshop”, IEEE Conference on Emerging Technologies and Factory Automation, 1, 215-220.
124. Vignier, A., P. Commandeur and C. Proust. (1997). “New lower bound for the hybrid flowshop scheduling problem”, 6th International Conference on Emerging Technologies and Factory Automation, 446-451.
125. Wang, L. and D. Li. (2002). “A scheduling algorithm for flexible flowshop problem”, Proceedings of the 4th World Congress on Intelligent Control and Automation, Shangai, China.
126. Wang, H. (2005). “Flexible flowshop scheduling: optimum, heuristics and artificial intelligence solutions”, Expert Systems, 22(2), 78-85.
127. Wang, Z., W. Xing and F. Bai. (2005). “No-wait flexible flowshop with no-idle machines”, Operations Research Letters, 33, 609-614.
128. Wang, S. and M. Liu. (2013a). “A heuristic method for two-stage hybrid flow shop with dedicated machines”, Computers & Operations Research, 40, 438-450.
129. Wang, S. and M. Liu. (2013b). “A genetic algorithm for tow-stage no-wait hybrid flow shop scheduling problem”, Computers & Operations Research, 40, 1064-1075.
130. Wittrock, R.J. (1985). “Scheduling algorithms for flexible flow lines”, IBM Journal of Research & Development, 29(4), 401-412.
131. Wittrock, R.J. (1988). “An adaptable scheduling algorithm for flexible flow lines”, Operations Research, 36(3), 445-453.
132. Xie, J. and X. Wang. (2005). “Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints", Computers & Mathematics with Applications, 50, 1629-1638.
133. Yang, Y. (1998). Optimization and Heuristic Algorithms for flexible Flow Shop Scheduling, Thesis of PhD in the Graduate School of Arts and Science, Columbia University. Columbia. Yang, Y., S. Kreipl and M. Pinedo. (2000). “Heuristics for minimizing total weighted tardiness in flexible flow shops”, Journal of Scheduling, 3, 89-108.
134. Yang, J. (2011). “Minimizing total completion time in two-stage hybrid flow shop with dedicated machines”, Computers & Operations Research, 38, 1045-1053.
135. Yu, L., A. Ohsato, T. Kawakami and T. Sekiguchi. (1999). “COBRA-based design and development of distributed scheduling systems: An application to flexible flowshop scheduling systems”, IEEE International Conference on Systems, Man & Cybernetics, Niigata.
136. Zandieh, M., S.M.T. Fatemi Ghomi and S.M. Moattar Husseini. (2006). “An immune algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times”, Applied Mathematics & Computation, 180, 111-127.
137. Zandieh, M. and M. Gholami. (2009). “An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns”, International Journal of Production Research, 47(24), 6999-7027.
138. Zandieh, M., & Hashemi, A. R. (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.
139. Zhang, B., Pan, Q. K., Gao, L., Zhang, X. L., Sang, H. Y., & Li, J. Q. (2017). An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming. Applied Soft Computing, 52, 14-27.