Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping

References

• Allahverdi, A., J. N. D. Gupta, and T. Aldowaisan. 1999. “A Review of Scheduling Research Involving Setup Considerations.” Omega 27: 219–239. doi: 10.1016/S0305-0483(98)00042-5
   Web of Science ®Google Scholar
• Allaoui, H., and A. Artiba. 2006. “Scheduling Two-Stage Hybrid Flow Shop with Availability Constraints.” Computers and Operations Research 33: 1399–1419. doi: 10.1016/j.cor.2004.09.034
   Web of Science ®Google Scholar
• Azami, A., K. Demirli, and N. Bhuiyan. 2018. “Scheduling in Aerospace Composite Mahufacturing Systems: A Two-Stage Hybried Flow Shop Problem.” International Journal of Advanced Manufacturing Technology 95 (9–12): 3259–3274. doi: 10.1007/s00170-017-1429-0
   Web of Science ®Google Scholar
• Behnamian, J. 2014. “Decomposition Based Hybrid VNS-TS Algorithm for Distributed Parallel Factories Scheduling with Virtual Corporation.” Computers and Operations Research 52: 181–191. doi: 10.1016/j.cor.2013.11.017
   Web of Science ®Google Scholar
• Behnamian, J., and S. M. T. Fatemi Ghomi. 2013. “The Heterogeneous Multi-Factory Production Network Scheduling with Adaptive Communication Policy and Parallel Machine.” Information Science 219: 181–196. doi: 10.1016/j.ins.2012.07.020
   Web of Science ®Google Scholar
• Behnamian, J., and S. M. T. Fatemi Ghomi. 2015. “Minimizing Cost-Related Objective in Synchronous Scheduling of Parallel Factories in the Virtual Production Network.” Applied Soft Computing 29: 221–232. doi: 10.1016/j.asoc.2015.01.003
   Web of Science ®Google Scholar
• Chen, Z. L., and G. Pundoor. 2006. “Order Assignment and Scheduling in a Supply Chain.” Operations Research 54 (3): 555–572. doi: 10.1287/opre.1060.0280
   Web of Science ®Google Scholar
• Deb, K., A. Pratap, S. Agarwal, and T. Meyarivan. 2002. “A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II.” IEEE Transactions on Evolutionary Computation 6 (2): 182–197. doi: 10.1109/4235.996017
   Web of Science ®Google Scholar
• Deng, J., L. Wang, S. Y. Wang, and X. L. Zheng. 2017. “A Competitive Memetic Algorithm for the Distributed Two-Stage Assembly Flow-Shop Scheduling Problem.” International Journal of Production Research 54 (12): 1–17.
   Web of Science ®Google Scholar
• Eusuff, M. M., K. E. Lansey, and F. Pasha. 2006. “Shuffled Frog-Leaping Algorithm: A Memetic Meta-Heuristic for Discrete Optimization.” Engineering Optimization 38 (2): 129–154. doi:10.1080/03052150500384759.
   Web of Science ®Google Scholar
• Feng, Xin, Feifeng Zheng, and Yinfeng Xu. 2016. “Robust Scheduling of a Two-Stage Hybrid Flow Shop with Uncertain Interval Processing Times.” International Journal of Production Research 54 (12): 1–12. doi:10.1080/00207543.2016.1162341.
   Web of Science ®Google Scholar
• Figielska, E. 2014. “A Heuristic for Scheduling in a Two-Stage Hybrid Flowshop with Renewable Resources Shared Among the Stages.” European Journal of Operational Research 236 (2): 433–444. doi: 10.1016/j.ejor.2013.12.003
   Web of Science ®Google Scholar
• 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: 10.1080/00207543.2011.644819
   Web of Science ®Google Scholar
• Hatami, S., R. Ruiz, and C. Andrés-Romano. 2015. “Heuristics and Metaheuristics for the Distributed Assembly Permutation Flowshop Scheduling Problem with Sequence Dependent Setup Times.” International Journal of Production Economics 169: 76–88. doi: 10.1016/j.ijpe.2015.07.027
   Web of Science ®Google Scholar
• Hekmatfar, M., S. M. T. Fatemi Ghomi, and B. Karimi. 2011. “Two Stage Reentrant Hybrid Flow Shop with Setup Times and the Criterion of Minimizing Makespan.” Applied Soft Computing 11: 4530–4539. doi: 10.1016/j.asoc.2011.08.013
   Web of Science ®Google Scholar
• Knowles, J. D., and D. W. Corne. 2002. “On Metrics for Comparing Non-Dominated Sets.” In Proceedings of the 2002 Congress on Evolutionary Computation (CEC'02), 711–716. Piscataway, NJ: IEEE. doi:10.1109/CEC.2002.1007013.
   Google Scholar
• Komaki, M., and B. Malakooti. 2017. “General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed No-Wait Flow Shop Scheduling Problem.” Production Engineering 11 (3): 315–329. doi: 10.1007/s11740-017-0716-9
   Google Scholar
• Komaki, G. M., E. Teymourian, and V. Kayvanfar. 2016. “Minimising Makespan in the Two-Stage Assembly Hybrid Flow Shop Scheduling Problem Using Artificial Immune Systems.” International Journal of Production Research 54: 963–983. doi: 10.1080/00207543.2015.1035815
   Web of Science ®Google Scholar
• Lee, G. C., J. M. Hong, and S. H. Choi. 2015. “Efficient Heuristic Algorithm for Scheduling Two-Stage Hybrid Flowshop with Sequence-Dependent Setup Times.” Mathematical Problems in Engineering 2015 (1): 1–10. doi:10.1155/2015/420308.0.
   Web of Science ®Google Scholar
• Lei, D. M., and X. P. Guo. 2015. “A Shuffled Frog Leaping Algorithm for Hybrid Flow Shop Scheduling with Two Agents.” Expert Systems with Applications 42 (23): 9333–9339.
   Google Scholar
• Lei, D. M., and X. P. Guo. 2016. “A Shuffled Frog Leaping Algorithm for Job Shop Scheduling with Outsourcing Options.” International Journal of Production Research 54 (16): 4793–4804. doi: 10.1080/00207543.2015.1088970
   Web of Science ®Google Scholar
• Lei, D. M., Y. Yuan, J. C. Cai, and D. Y. Bai. 2019. “An Imperialist Competitive Algorithm with Memory for Distributed Unrelated Parallel Machines Scheduling.” International Journal of Production Research. doi:10.1080/00207543.2019.1598596.
   PubMed Web of Science ®Google Scholar
• Lei, D. M., Y. L. Zheng, and X. P. Guo. 2017. “A Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling with the Consideration of Energy Consumption.” International Journal of Production Research 55 (11): 3126–3140. doi: 10.1080/00207543.2016.1262082
   Web of Science ®Google Scholar
• Li, J. Q., Q. K. Pan, and S. G. Xie. 2012. “An Effective Shuffled Frog-Leaping Algorithm for Multi-Objective Flexible Job Shop Scheduling Problems.” Applied Mathematics and Computation 218 (18): 9353–9371. doi: 10.1016/j.amc.2012.03.018
   Web of Science ®Google Scholar
• Lin, H. T., and C. J. 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. doi: 10.1016/S0925-5273(03)00011-2
   Web of Science ®Google Scholar
• Lin, J., Z. J. Wang, and X. Li. 2017. “A Backtracking Search Hyper-Heuristic for the Distributed Assembly Flow-Shop Scheduling Problem.” Swarm and Evolutionary Computation 36: 1–12. doi: 10.1016/j.swevo.2017.04.007
   Web of Science ®Google Scholar
• Lin, S. W., and K. C. Ying. 2016. “Minimizing Makespan for Solving the Distributed No-Wait Flowshop Scheduling Problem.” Computers and Industrial Engineering 99: 202–209. doi: 10.1016/j.cie.2016.07.027
   Web of Science ®Google Scholar
• 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: 10.1080/00207543.2013.790571
   Web of Science ®Google Scholar
• Lin, J., and S. Zhang. 2016. “An Effective Hybrid Biogeography-Based Optimization Algorithm for the Distributed Assembly Permutation Flow-Shop Scheduling Problem.” Computers and Industrial Engineering 97: 128–136. doi: 10.1016/j.cie.2016.05.005
   Web of Science ®Google Scholar
• Lu, K., T. Li, K. M. Wang, H. B. Zhu, M. Takano, and B. Yu. 2015. “An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem.” Algorithms 8 (1): 19–31. doi: 10.3390/a8010019
   Web of Science ®Google Scholar
• 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: 10.1016/j.ejor.2014.05.024
   Web of Science ®Google Scholar
• Nawaz, M., E. E. Enscore Jr, and I. Ham. 1983. “An Heuristic Algorithm for the m-Machine, n-Job Flow-Shop Sequencing Problem.” Omega 11 (1): 91–95. doi:10.1016/0305-0483(83)90088-9.
   Web of Science ®Google Scholar
• Pan, Q. K., L. Wang, L. Gao, and J. Q. Li. 2011. “An Effective Shuffled Frog-Leaping Algorithm for Lot-Streaming Flow Shop Scheduling Problem.” International Journal of Advanced Manufacturing Technology 52 (8): 699–713. doi: 10.1007/s00170-010-2775-3
   Web of Science ®Google Scholar
• Rabiee, M., R. S. Rad, M. Mazinani, and R. Shafaei. 2014. “An Intelligent Hybrid Meta-Heuristic for Solving a Case of No-Wait Two-Stage Flexible Flow Shop Scheduling Problem with Unrelated Parallel Machines.” International Journal of Advanced Manufacturing Technology 71 (5–8): 1229–1245. doi:10.1007/s00170-013-5375-1.
   Web of Science ®Google Scholar
• Rahimi-Vahed, A., M. Dangchi, H. Rafiei, and E. Salimi. 2009. “A Novel Hybrid Multi-Objective Shuffled Frog-Leaping Algorithm for a Bi-Criteria Permutation Flow Shop Scheduling Problem.” International Journal of Advanced Manufacturing Technology 41 (11–12): 1227–1239. doi: 10.1007/s00170-008-1558-6
   Web of Science ®Google Scholar
• 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 40: 42–57. doi: 10.1016/j.asoc.2015.11.034
   Web of Science ®Google Scholar
• Ruiz, R., and J. A. Vázquez-Rodríguez. 2010. “The Hybrid Flow Shop Scheduling Problem.” European Journal of Operational Research 205: 1–18. doi: 10.1016/j.ejor.2009.09.024
   Web of Science ®Google Scholar
• Shao, W. S., D. C. Pi, and Z. S. 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: 10.1016/j.knosys.2017.09.026
   Web of Science ®Google Scholar
• Tan, Y., L. Mönch, and J. W. Fowler. 2017. “A Hybrid Scheduling Approach for a Two-Stage Flexible Flow Shop with Batch Processing Machines.” Journal of Scheduling 21 (1): 1–18.
   Google Scholar
• Terrazas, M., and I. E. Grossmann. 2011. “A Multiscale Decomposition Method for the Optimal Planning and Scheduling of Multi-Site Continuous Multiproduct Plants.” Chemical Engineering Science 66 (19): 4307–4318. doi: 10.1016/j.ces.2011.03.017
   Web of Science ®Google Scholar
• Wang, L., and C. Fang. 2011. “An Effective Shuffled Frog-Leaping Algorithm for Multi-Mode Resource-Constrained Project Scheduling Problem.” Information Science 181 (20): 4604–4822.
   Web of Science ®Google Scholar
• Wang, S., and M. Liu. 2013a. “A Heuristic Method for Two-Stage Hybrid Flow Shop with Dedicated Machines.” Computers and Operations Research 40 (1): 438–450. doi: 10.1016/j.cor.2012.07.015
   Web of Science ®Google Scholar
• Wang, S., and M. Liu. 2013b. “A Genetic Algorithm for Two-Stage No-Wait Hybrid Flow Shop Scheduling Problem.” Computers and Operations Research 40 (4): 1064–1075. doi: 10.1016/j.cor.2012.10.015
   Web of Science ®Google Scholar
• Wang, S., and M. Liu. 2014. “Two-Stage Hybrid Flow Shop Scheduling with Preventive Maintenance Using Multi-Objective Tabu Search Method.” International Journal of Production Research 52 (5): 1495–1508. doi: 10.1080/00207543.2013.847983
   Web of Science ®Google Scholar
• 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: 10.1016/j.ijpe.2013.05.004
   Web of Science ®Google Scholar
• Xiong, F., and K. Xing. 2014. “Meta-Heuristics for the Distributed Two-Stage Assembly Scheduling Problem with Bi-Criteria of Makespan and Mean Completion Time.” International Journal of Production Research 52 (9): 2743–2766. doi: 10.1080/00207543.2014.884290
   Web of Science ®Google Scholar
• 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: 10.1080/0305215X.2013.827673
   Web of Science ®Google Scholar
• Yang, J. 2011. “Minimizing Total Completion Time in Two-Stage Hybrid Flow Shop with Dedicated Machines.” Computers and Operations Research 38 (7): 1045–1053. doi: 10.1016/j.cor.2010.10.009
   Web of Science ®Google Scholar
• 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: 10.1109/ACCESS.2017.2732738
   Web of Science ®Google Scholar
• 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: 10.1016/j.eswa.2017.09.032
   Web of Science ®Google Scholar
• Yu, J. M., R. Huang, and D. H. Lee. 2017. “Iterative Algorithms for Batching and Scheduling to Minimise the Total Job Tardiness in Two-Stage Hybrid Flow Shops.” International Journal of Production Research 55 (11): 3266–3282. doi: 10.1080/00207543.2017.1304661
   Web of Science ®Google Scholar
• Zeng, C. K., J. F. Tang, Z. P. Fan, and C. J. Yan. 2019a. “Auction-Based Approach for a Flexible Job-Shop Scheduling Problem with Multiple Process Plans.” Engineering Optimization 51 (11): 1902–1919. doi:10.1080/0305215X.2018.1561884.
   Web of Science ®Google Scholar
• Zeng, C. K., J. F. Tang, Z. P. Fan, and C. J. Yan. 2019b. “Scheduling of a Job-Shop Problem with Limited Output Buffers.” Engineering Optimization. doi:10.1080/0305215X.2019.1577407.
   Web of Science ®Google Scholar
• Zhang, G., K. Xing, and F. Cao. 2018. “Scheduling Distributed Flowshops with Flexible Assembly and Set-Up Time to Minimise Makespan.” International Journal of Production Research 56 (9): 3226–3244. doi: 10.1080/00207543.2017.1401241
   Web of Science ®Google Scholar
• Zhou, B. H., X. M. Liao, and K. Wang. 2019. “Kalman Filter and Multi-Stage Learning-Based Hybrid Differential Evolution Algorithm with Particle Swarm for a Two-Stage Flow Shops Scheduling Problem.” Soft Computing. doi:10.1007/s00500-019-03852-4.
   Google Scholar
• Zitzler, E., and L. Thiele. 1999. “Multi-Objective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach.” IEEE Transactions on Evolutionary Computation 3 (4): 257–271. doi: 10.1109/4235.797969
   Web of Science ®Google Scholar