References
- Bargaoui, H., O. B. Driss, and K. Ghédira. 2017. “A Novel Chemical Reaction Optimization for the Distributed Permutation Flowshop Scheduling Problem with Makespan Criterion.” Computers and Industrial Engineering 111: 239–250. doi:https://doi.org/10.1016/j.cie.2017.07.020.
- Cai, J., D. Lei, and M. Li. 2020. “A Shuffled Frog-Leaping Algorithm with Memeplex Quality for Bi-Objective Distributed Scheduling in Hybrid Flow Shop.” International Journal of Production Research (June 25, 2020), 1–18. doi:https://doi.org/10.1080/00207543.2020.1780333.
- Chen, T., and X. Li. 2013. “Integrated Iterated Local Search for the Permutation Flowshop Problem with Tardiness Minimization.” Proceedings – 2013 IEEE international Conference on systems, Man, and Cybernetics, SMC 2013. doi:https://doi.org/10.1109/SMC.2013.478.
- Cheng, C.-Y., K.-C. Ying, H.-H. Chen, and H.-S. Lu. 2018. “Minimising Makespan in Distributed Mixed no-Idle Flowshops.” International Journal of Production Research 57 (1): 48–60. doi:https://doi.org/10.1080/00207543.2018.1457812.
- Costa, W. E., M. C. Goldbarg, and E. G. Goldbarg. 2012. “Hybridizing VNS and Path-Relinking on a Particle Swarm Framework to Minimize Total Flowtime.” Expert Systems with Applications 39 (18): 13118–13126. doi:https://doi.org/10.1016/j.eswa.2012.05.090.
- Cura, T. 2015. “An Evolutionary Algorithm for the Permutation Flowshop Scheduling Problem with Total Tardiness Criterion.” International Journal of Operational Research 22 (3): 366–384. doi:https://doi.org/10.1504/IJOR.2015.068287.
- Du, J, and J. Y.-T. Leung. 1990. “Minimizing Total Tardiness on One Machine is NP-Hard.” Mathematics of Operations Research 15 (3): 483–495. doi:https://doi.org/10.1287/moor.15.3.483.
- Fernandez-Viagas, V., and J. M. Framinan. 2015a. “A Bounded-Search Iterated Greedy Algorithm for the Distributed Permutation Flowshop Scheduling Problem.” International Journal of Production Research 53 (4): 1111–1123. doi:https://doi.org/10.1080/00207543.2014.948578.
- Fernandez-Viagas, V., and J. M. Framinan. 2015b. “NEH-Based Heuristics for the Permutation Flowshop Scheduling Problem to Minimise Total Tardiness.” Computers and Operations Research, doi:https://doi.org/10.1016/j.cor.2015.02.002.
- Fernandez-Viagas, V., P. Perez-Gonzalez, and J. M. Framinan. 2018. “The Distributed Permutation Flow Shop to Minimise the Total Flowtime.” Computers and Industrial Engineering 118: 464–477. doi:https://doi.org/10.1016/j.cie.2018.03.014.
- Fernandez-Viagas, V., J. M. Valente, and J. M. Framinan. 2018. “Iterated-Greedy-Based Algorithms with Beam Search Initialization for the Permutation Flowshop to Minimise Total Tardiness.” Expert Systems with Applications 94: 58–69. doi:https://doi.org/10.1016/j.eswa.2017.10.050.
- Gao, J., and R. Chen. 2011. “A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem.” International Journal of Computational Intelligence Systems 4 (4): 497–508. doi:https://doi.org/10.1080/18756891.2011.9727808.
- Gao, J., R. Chen, and W. Deng. 2013. “An Efficient Tabu Search Algorithm for the Distributed Permutation Flowshop Scheduling Problem.” International Journal of Production Research 51 (3): 641–651. doi:https://doi.org/10.1080/00207543.2011.644819.
- Glover, F., and M. Laguna. 1998. “Tabu Search.” Handbook of Combinatorial Optimization, 2093–2229. doi:https://doi.org/10.1007/978-1-4613-0303-9_33.
- Golilarz, N. A., H. Gao, and H. Demirel. 2019. “Satellite Image De-Noising with Harris Hawks Meta Heuristic Optimization Algorithm and Improved Adaptive Generalized Gaussian Distribution Threshold Function.” IEEE Access 7: 57459–57468. doi:https://doi.org/10.1109/ACCESS.2019.2914101.
- Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. R. Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics, 287–326. doi:https://doi.org/10.1016/s0167-5060(08)70356-x.
- Hamzadayi, A. 2020. “An Effective Benders Decomposition Algorithm for Solving the Distributed Permutation Flowshop Scheduling Problem.” Computers & Operations Research, 105006. doi:https://doi.org/10.1016/j.cor.2020.105006.
- Hasija, S., and C. Rajendran. 2004. “Scheduling in Flowshops to Minimize Total Tardiness of Jobs.” International Journal of Production Research 42 (11): 2289–2301. doi:https://doi.org/10.1080/00207540310001657595.
- Heidari, A. A., S. Mirjalili, H. Faris, I. Aljarah, M. Mafarja, and H. Chen. 2019. “Harris Hawks Optimization: Algorithm and Applications.” Future Generation Computer Systems 97: 849–872. doi:https://doi.org/10.1016/j.future.2019.02.028.
- Huang, J. P., Q. K. Pan, and L. Gao. 2020. “An Effective Iterated Greedy Method for the Distributed Permutation Flowshop Scheduling Problem with Sequence-Dependent Setup Times.” Swarm and Evolutionary Computation 59: 100742. doi:https://doi.org/10.1016/j.swevo.2020.100742.
- Karabulut, K. 2016. “A Hybrid Iterated Greedy Algorithm for Total Tardiness Minimization in Permutation Flowshops.” Computers and Industrial Engineering 98: 300–307. doi:https://doi.org/10.1016/j.cie.2016.06.012.
- Kellegöz, T., B. Toklu, and J. Wilson. 2010. “Elite Guided Steady-State Genetic Algorithm for Minimizing Total Tardiness in Flowshops.” Computers and Industrial Engineering 58 (2): 300–306. doi:https://doi.org/10.1016/j.cie.2009.11.001.
- Khare, A., and S. Agrawal. 2019. “Scheduling Hybrid Flowshop with Sequence-Dependent Setup Times and Due Windows to Minimize Total Weighted Earliness and Tardiness.” Computers and Industrial Engineering 135: 780–792. doi:https://doi.org/10.1016/j.cie.2019.06.057.
- Kim, Y. D. 1993. “Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness.” Journal of the Operational Research Society 44 (1): 19–28. doi:https://doi.org/10.1057/jors.1993.3.
- Li, J. Q., S. C. Bai, P. Y. Duan, H. Y. Sang, Y. Y. Han, and Z. X. Zheng. 2019. “An Improved Artificial Bee Colony Algorithm for Addressing Distributed Flow Shop with Distance Coefficient in a Prefabricated System.” International Journal of Production Research 57 (22): 6922–6942. doi:https://doi.org/10.1080/00207543.2019.1571687.
- Li, X., L. Chen, H. Xu, and J. N. Gupta. 2015. “Trajectory Scheduling Methods for Minimizing Total Tardiness in a Flowshop.” Operations Research Perspectives 2: 13–23. doi:https://doi.org/10.1016/j.orp.2014.12.001.
- Li, Y., X. Li, L. Gao, B. Zhang, Q. K. Pan, M. F. Tasgetiren, and L. Meng. 2020. “A Discrete Artificial bee Colony Algorithm for Distributed Hybrid Flowshop Scheduling Problem with Sequence-Dependent Setup Times.” International Journal of Production Research, 1–20. doi:https://doi.org/10.1080/00207543.2020.1753897.
- Lin, S. W., K. C. Ying, and C. Y. Huang. 2013. “Minimising Makespan in Distributed Permutation Flowshops Using a Modified Iterated Greedy Algorithm.” International Journal of Production Research 51 (16): 5029–5038. doi:https://doi.org/10.1080/00207543.2013.790571.
- Meng, T., Q. K. Pan, and L. Wang. 2019. “A Distributed Permutation Flowshop Scheduling Problem with the Customer Order Constraint.” Knowledge-Based Systems 184: 104894. doi:https://doi.org/10.1016/j.knosys.2019.104894.
- Moayedi, H., H. Nguyen, and A. S. A. Rashid. 2019. “Comparison of Dragonfly Algorithm and Harris Hawks Optimization Evolutionary Data Mining Techniques for the Assessment of Bearing Capacity of Footings Over Two-Layer Foundation Soils.” Engineering with Computers, 1–11. doi:https://doi.org/10.1007/s00366-019-00834-w.
- Montgomery, D. C. 2007. Design and Analysis of Experiments. 5th ed. New York: John Wiley & Sons.
- Naderi, B., and R. Ruiz. 2010. “The Distributed Permutation Flowshop Scheduling Problem.” Computers and Operations Research 37 (4): 754–768. doi:https://doi.org/10.1016/j.cor.2009.06.019.
- Naderi, B., and R. Ruiz. 2014. “A Scatter Search Algorithm for the Distributed Permutation Flowshop Scheduling Problem.” European Journal of Operational Research 239 (2): 323–334. doi:https://doi.org/10.1016/j.ejor.2014.05.024.
- Olhager, J., and A. Feldmann. 2017. “Distribution of Manufacturing Strategy Decision-Making in Multi-Plant Networks.” International Journal of Production Research 56 (1–2): 692–708. doi:https://doi.org/10.1080/00207543.2017.1401749.
- Pan, Q. K., L. Gao, L. Wang, J. Liang, and X. Y. Li. 2019. “Effective Heuristics and Metaheuristics to Minimize Total Flowtime for the Distributed Permutation Flowshop Problem.” Expert Systems with Applications 124: 309–324. doi:https://doi.org/10.1016/j.eswa.2019.01.062.
- Pan, Q. K., L. Wang, H. Y. Sang, J. Q. Li, and M. Liu. 2013. “A High Performing Memetic Algorithm for the Flowshop Scheduling Problem with Blocking.” IEEE Transactions on Automation Science and Engineering 10 (3): 741–756. doi:https://doi.org/10.1109/TASE.2012.2219860.
- Ribas, I., R. Companys, and X. Tort-Martorell. 2017. “Efficient Heuristics for the Parallel Blocking Flow Shop Scheduling Problem.” Expert Systems with Applications 74: 41–54. doi:https://doi.org/10.1016/j.eswa.2017.01.006.
- Rifai, A. P., H. T. Nguyen, and S. Z. M. Dawal. 2016. “Multi-Objective Adaptive Large Neighborhood Search for Distributed Reentrant Permutation Flow Shop Scheduling.” Applied Soft Computing Journal 40: 42–57. doi:https://doi.org/10.1016/j.asoc.2015.11.034.
- Ruiz, R., Q. K. Pan, and B. Naderi. 2018. “Iterated Greedy Methods for the Distributed Permutation Flowshop Scheduling Problem.” Omega 83: 213–222. doi:https://doi.org/10.1016/j.omega.2018.03.004.
- Ruiz, R., and T. Stützle. 2007. “A Simple and Effective Iterated Greedy Algorithm for the Permutation Flowshop Scheduling Problem.” European Journal of Operational Research 177 (3): 2033–2049. doi:https://doi.org/10.1016/j.ejor.2005.12.009.
- Shao, W., D. Pi, and Z. Shao. 2017. “Optimization of Makespan for the Distributed No-Wait Flow Shop Scheduling Problem with Iterated Greedy Algorithms.” Knowledge-Based Systems 137: 163–181. doi:https://doi.org/10.1016/j.knosys.2017.09.026.
- Shao, Z., D. Pi, and W. Shao. 2020. “Hybrid Enhanced Discrete Fruit fly Optimization Algorithm for Scheduling Blocking Flow-Shop in Distributed Environment.” Expert Systems with Applications 145: 113147. doi:https://doi.org/10.1016/j.eswa.2019.113147.
- Taillard, E. 1993. “Benchmarks for Basic Scheduling Problems.” European Journal of Operational Research 64 (2): 278–285. doi:https://doi.org/10.1016/0377-2217(93)90182-M.
- Tasgetiren, M. F., Y. C. Liang, M. Sevkli, and G. Gencyilmaz. 2007. “A Particle Swarm Optimization Algorithm for Makespan and Total Flowtime Minimization in the Permutation Flowshop Sequencing Problem.” European Journal of Operational Research 177 (3): 1930–1947. doi:https://doi.org/10.1016/j.ejor.2005.12.024.
- Vallada, E., and R. Ruiz. 2010. “Genetic Algorithms with Path Relinking for the Minimum Tardiness Permutation Flowshop Problem.” Omega 38 (1-2): 57–67. doi:https://doi.org/10.1016/j.omega.2009.04.002.
- Vallada, E., R. Ruiz, and G. Minella. 2008. “Minimising Total Tardiness in the M-Machine Flowshop Problem: A Review and Evaluation of Heuristics and Metaheuristics.” Computers and Operations Research 35 (4): 1350–1373. doi:https://doi.org/10.1016/j.cor.2006.08.016.
- Wang, S. Y., L. Wang, M. Liu, and Y. Xu. 2013. “An Effective Estimation of Distribution Algorithm for Solving the Distributed Permutation Flow-Shop Scheduling Problem.” International Journal of Production Economics 145 (1): 387–396. doi:https://doi.org/10.1016/j.ijpe.2013.05.004.
- Xu, Y., L. Wang, S. Wang, and M. Liu. 2014. “An Effective Hybrid Immune Algorithm for Solving the Distributed Permutation Flow-Shop Scheduling Problem.” Engineering Optimization 46 (9): 1269–1283. doi:https://doi.org/10.1080/0305215X.2013.827673.
- Ying, K. C., and S. W. Lin. 2017. “Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms.” IEEE Access 5: 15694–15705. doi:https://doi.org/10.1109/ACCESS.2017.2732738.
- Ying, K. C., and S. W. Lin. 2018. “Minimizing Makespan for the Distributed Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks.” Expert Systems with Applications 92: 132–141. doi:https://doi.org/10.1016/j.eswa.2017.09.032.
- Ying, K. C., S. W. Lin, C. Y. Cheng, and C. D. He. 2017. “Iterated Reference Greedy Algorithm for Solving Distributed No-Idle Permutation Flowshop Scheduling Problems.” Computers and Industrial Engineering 110: 413–423. doi:https://doi.org/10.1016/j.cie.2017.06.025.
- Zhang, G., and K. Xing. 2019. “Differential Evolution Metaheuristics for Distributed Limited-Buffer Flowshop Scheduling with Makespan Criterion.” Computers and Operations Research 108: 33–43. doi:https://doi.org/10.1016/j.cor.2019.04.002.
- Zhang, G., K. Xing, and F. Cao. 2017. “Scheduling Distributed Flowshops with Flexible Assembly and set-up Time to Minimise Makespan.” International Journal of Production Research 56 (9): 3226–3244. doi:https://doi.org/10.1080/00207543.2017.1401241.
- Zhao, F., L. Zhao, L. Wang, and H. Song. 2020. “An Ensemble Discrete Differential Evolution for the Distributed Blocking Flowshop Scheduling with Minimizing Makespan Criterion.” Expert Systems with Applications 160: 113678. doi:https://doi.org/10.1016/j.eswa.2020.113678.