References
1. Pinedo, M.L. "Scheduling: Theory, Algorithms, and Systems". p. 670. Springer International Publishing (2016).
2. Baker, K.R. "Introduction to sequencing and scheduling". pp. ix, 305 p. Wiley New York, (1974).
3. Che, A., Chabrol, M., Gourgand, M., et al. . "Scheduling multiple robots in a no-wait re-entrant robotic flowshop", International Journal of Production Economics, 135(1), pp. 199-208 (2012).
4. Pan, J.-H. and Chen, J.S. "Minimizing makespan in re-entrant permutation flow-shops", Journal of the Operational Research Society, 54(6), pp. 642-653 (2003).
5. Choi, S.W. and Kim, Y.D. "Minimizing makespan on a two-machine re-entrant flowshop", Journal of the Operational Research Society, 58(7), pp. 972-981 (2007).
6. Bootaki, B. and Paydar, M.M. "On the n-job, m-machine permutation flow shop scheduling problems with makespan criterion and rework", Scientia Iranica, 25(3), pp. 1688-1700 (2018).
7. Abbaszadeh, N., Asadi-Gangraj, E. and emami, s. "Flexible flow shop scheduling problem to minimize makespan with renewable resources", Scientia Iranica, pp. - (2019).
8. Gholami, H.R., Mehdizadeh, E. and Naderi, B. "Mathematical models and an elephant herding optimization for multiprocessor-task flexible flow shop scheduling problems in the Manufacturing Resource Planning (MRPII) system", Scientia Iranica, 27(3), pp. 1562-1571 (2020).
9. Shao, Z., Shao, W. and Pi, D. "Effective heuristics and metaheuristics for the distributed fuzzy blocking flow-shop scheduling problem", Swarm and Evolutionary Computation, 59 p. 100747 (2020).
10. Wang, G., Gao, L., Li, X., et al. . "Energy-efficient distributed permutation flow shop scheduling problem using a multi-objective whale swarm algorithm", Swarm and Evolutionary Computation, 57 p. 100716 (2020).
11. Baskar, A. and Xavior, M.A. "New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems", Computers & Operations Research, 133 p. 105348 (2021).
12. Ozcan, B., Yavuz, M. and Fıglalı, A. "A data mining-based solution method for flow shop scheduling problems", Scientia Iranica, 28(2), pp. 950-969 (2021).
13. Wu, C.-C., Liu, S.-C., Cheng, T.C.E., et al. . "Re-Entrant Flowshop Scheduling With Learning Considerations to Minimize The Makespan", Iranian Journal of Science and Technology, Transactions A: Science, 42(2), pp. 727-744 (2018).
14. Rifai, A.P., Kusumastuti, P.A. and Mara, S.T.W. "MULTI-OPERATOR HYBRID GENETIC ALGORITHM-SIMULATED ANNEALING FOR REENTRANT PERMUTATION FLOW-SHOP SCHEDULING", ASEAN Engineering Journal, 11(3), pp. 109-126 (2021).
15. Huang, J.D., Liu, J.J., Chen, Q.X., et al. . "Minimizing makespan in a two-stage flow shop with parallel batch-processing machines and re-entrant jobs", Engineering Optimization, 49(6), pp. 1010-1023 (2017).
16. Geng, K., Ye, C., Cao, L., et al. . "Multi-Objective Reentrant Hybrid Flowshop Scheduling with Machines Turning on and off Control Strategy Using Improved Multi-Verse Optimizer Algorithm", Mathematical Problems in Engineering, 2019 p. 2573873 (2019).
17. Amin Naseri, M.R., Tasouji Hassanpour, S. and Nahavandi, N. "Solving Re-entrant No-wait Flow Shop Scheduling Problem", International Journal of Engineering, 28(6), pp. 903-912 (2015).
18. Chen, J.-S. and Chao-Hsien Pan, J. "Integer programming models for the re-entrant shop scheduling problems", Engineering Optimization, 38(5), pp. 577-592 (2006).
19. Chen, J.-S., Pan, J.C.-H. and Lin, C.-M. "A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem", Expert Systems with Applications, 34(1), pp. 570-577 (2008).
20. Jing, C., Tang, G. and Qian, X. "Heuristic algorithms for two machine re-entrant flow shop", Theoretical Computer Science, 400(1), pp. 137-143 (2008).
21. Lin, D., Lee, C.K.M. and Ho, W. "Multi-level genetic algorithm for the resource-constrained re-entrant scheduling problem in the flow shop", Engineering Applications of Artificial Intelligence, 26(4), pp. 1282-1290 (2013).
22. Xu, J., Yin, Y., Cheng, T.C.E., et al. . "A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan", Applied Soft Computing, 24 pp. 277-283 (2014).
23. Choi, S.-W. and Kim, Y.-D. "Minimizing total tardiness on a two-machine re-entrant flowshop", European Journal of Operational Research, 199(2), pp. 375-384 (2009).
24. Lin, D., Lee, C.K.M. and Wu, Z. "Integrating analytical hierarchy process to genetic algorithm for re-entrant flow shop scheduling problem", International Journal of Production Research, 50(7), pp. 1813-1824 (2012).
25. Xu, J., Lin, W.-C., Wu, J., et al. . "Heuristic based genetic algorithms for the re-entrant total completion time flowshop scheduling with learning consideration", International Journal of Computational Intelligence Systems, 9(6), pp. 1082-1100 (2016).
26. Chamnanlor, C., Sethanan, K., Chien, C.-F., et al. . "Re-entrant flow shop scheduling problem with time windows using hybrid genetic algorithm based on auto-tuning strategy", International Journal of Production Research, 52(9), pp. 2612-2629 (2014).
27. Chamnanlor, C., Sethanan, K., Gen, M., et al. . "Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints", Journal of Intelligent Manufacturing, 28(8), pp. 1915-1931 (2017).
28. Waqas, U., Geilen, M., Kandelaars, J., et al. . "A re-entrant flowshop heuristic for online scheduling of the paper path in a large scale printer", Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 573-578 (2015)
29. Jeong, B. and Kim, Y.-D. "Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times", Computers & Operations Research, 47 pp. 72-80 (2014).
30. Kim, H. and Lee, D.H. "Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallel machines", Proceedings of The Institution of Mechanical Engineers Part B-journal of Engineering Manufacture - PROC INST MECH ENG B-J ENG MA, 223 pp. 433-442 (2009).
31. Lee, C.K.M., Lin, D., Ho, W., et al. . "Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs", The International Journal of Advanced Manufacturing Technology, 56(9), pp. 1105-1113 (2011).
32. Mousavi, S.M., Mahdavi, I., Rezaeian, J., et al. . "An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times", Operational Research, 18(1), pp. 123-158 (2018).
33. El-Khouly, I.A., El-Kilany, K.S. and El-Sayed, A.E. "Modelling and simulation of re-entrant flow shop scheduling: An application in semiconductor manufacturing", International Conference on Computers & Industrial Engineering, pp. 211-216 (2009)
34. Moghaddam, A., Yalaoui, F. and Amodeo, L. "A Genetic-based Algorithm to Find Better Estimation of Non-Dominated Solutions for a Bi-objective Re-entrant Flowshop Scheduling Problem with Outsourcing", IFAC Proceedings Volumes, 45(6), pp. 1383-1388 (2012).
35. Mousavi, S.M., Mahdavi, I., Rezaeian, J., et al. . "Bi-objective scheduling for the re-entrant hybrid flow shop with learning effect and setup times", Scientia Iranica, 25(4), pp. 2233-2253 (2018).
36. Behmanesh, R., Zandieh, M. and Hadji, M. "Multiple Resource Surgical Case Scheduling Problem: Ant Colony System Approach", Economic Computation and Economic Cybernetics Studies and Research, 54 pp. 251-268 (2020).
37. Behmanesh, R., Zandieh, M. and Hadji Molana, S.M. "The surgical case scheduling problem with fuzzy duration time: An ant system algorithm", Scientia Iranica, 26(3), pp. 1824-1841 (2019).
38. Zhang, G. and Xing, K. "Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion", Computers & Operations Research, 108 pp. 33-43 (2019).
39. Chen, J.-S., Pan, J.C.-H. and Wu, C.-K. "Hybrid tabu search for re-entrant permutation flow-shop scheduling problem", Expert Systems with Applications, 34(3), pp. 1924-1930 (2008).
40. Sangsawang, C., Sethanan, K., Fujimoto, T., et al. . "Metaheuristics optimization approaches for two-stage reentrant flexible flow shop with blocking constraint", Expert Systems with Applications, 42(5), pp. 2395-2410 (2015).
41. Oyetunji, E.O. and Oluleye, A.E. "Minimizing Makespan on Single Machine with Release Dates", International Journal of Advancements in Technology, 2(1), pp. 3-13 (2011).
42. Simon, D. "Biogeography-Based Optimization", IEEE Transactions on Evolutionary Computation, 12(6), pp. 702-713 (2008).
43. Karaboga, D. "An Idea Based on Honey Bee Swarm for Numerical Optimization, Technical Report - TR06", Technical Report, Erciyes University, (2005).
44. Glover, F. "Future paths for integer programming and links to artificial intelligence", Computers & Operations Research, 13(5), pp. 533-549 (1986).
45. Lawler, E.L. "Optimal Sequencing of a Single Machine Subject to Precedence Constraints", Management Science, 19(5), pp. 544-546 (1973).
46. Bean, J.C. "Genetic Algorithms and Random Keys for Sequencing and Optimization", ORSA Journal on Computing, 6(2), pp. 154-160 (1994).
47. Solimanpur, M. and Elmi, A. "A tabu search approach for cell scheduling problem with makespan criterion", International Journal of Production Economics, 141(2), pp. 639-645 (2013).
48. Kaplan, A.C. and Unal, A.T. "A probabilistic cost-based due date assignment model for job shops", International Journal of Production Research, 31(12), pp. 2817-2834 (1993).
49. Seidgar, H., Fazlollahtabar, H. and Zandieh, M. "Scheduling two-stage assembly flow shop with random machines breakdowns: integrated new self-adapted differential evolutionary and simulation approach", Soft Computing, 24(11), pp. 8377-8401 (2020).