269
Views
2
CrossRef citations to date
0
Altmetric
Research Articles

An adaptive artificial bee colony for hybrid flow shop scheduling with batch processing machines in casting process

, &
Pages 4793-4808 | Received 12 May 2023, Accepted 24 Oct 2023, Published online: 09 Nov 2023

References

  • Beldar, P., M. Moghtader, A. Giret, and A. H. Ansaripoor. 2022. “Non-identical Parallel Machines Batch Processing Problem with Release Dates, Due Dates and Variable Maintenance Activity to Minimize Total Tardiness.” Computers & Industrial Engineering 168:108135. https://doi.org/10.1016/j.cie.2022.108135.
  • Chen, L., H. Zheng, D. Zheng, and D. N. Li. 2015. “An Ant Colony Optimization-based Hyper-heuristic with Genetic Programming Approach for a Hybrid Flow Shop Scheduling Problem.” In 2015 IEEE Congress on Evolutionary Computation. https://doi.org/10.1109/CEC.2015.7256975.
  • Costa, A., V. Fernandez-Viagas, and J. M. Framinan. 2020. “Solving the Hybrid Flow Shop Scheduling Problem with Limited Human Resource Constraint.” Computers & Industrial Engineering 146:106545. https://doi.org/10.1016/j.cie.2020.106545.
  • Fan, J. X., Y. L. Li, J. Xie, C. J. Zhang, W. M. Shen, and L. Gao. 2023. “A Hybrid Evolutionary Algorithm Using Two Solution Representations for Hybrid Flow-shop Scheduling Problem.” IEEE Transactions on Cybernetics 53 (3): 1752–1764. https://doi.org/10.1109/TCYB.2021.3120875.
  • Han, W. W, Q. W. Deng, G. L. Gong, L. K. Zhang, and Q. Luo. 2020. “Multi-objective Evolutionary Algorithms with Heuristic Decoding for Hybrid Flow Shop Scheduling Problem with Worker Constraint.” Expert Systems with Applications 168:114282. https://doi.org/10.1016/j.eswa.2020.114282.
  • Jia, Z. H., S. Y. Huo, K. Li, and H. P. Chen. 2019. “Integrated Scheduling on Parallel Batch Processing Machines with Non-identical Capacities.” Engineering Optimization 51 (4): 715–730. https://doi.org/10.1080/0305215X.2019.1613388.
  • Jia, Z. H., T. T. Wen, J. Y. T. Leung, and K. Li. 2015. “Effective Heuristic for Makespan Minimization in Parallel Batch Machines with Non-identical Capacities.” Journal of Industrial & Management Optimization 169:1–10. https://doi.org/10.3934/jimo.2016057.
  • Ji, X. Y., H. Ye, J. X. Zhou, and W. L. Deng. 2016. “Digital Management Technology and Its Application to Investment Casting Enterprises.” China Foundry 13 (5): 301–309. https://doi.org/10.1007/s41230-016-6011-0.
  • Jiang, T., S. J. Lu, M. Y. Ren, H. Cheng, and X. B. Liu. 2023. “Modified Benders Decomposition and Metaheuristics for Multi-machine Parallel-batch Scheduling and Resource Allocation Under Deterioration Effect.” Computers & Industrial Engineering 176:108977. https://doi.org/10.1016/j.cie.2023.108977.
  • Karaboga, D. 2005. An Idea Based on Honey Bee Swarm for Numerical Optimization. Technical Report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department.
  • Kucukkoc, I., G. A. Keskin, A. D. Karaoglan, and S. Karadag. 2023. “A Hybrid Discrete Differential Evolution–genetic Algorithm Approach with a New Batch Formation Mechanism for Parallel Batch Scheduling Considering Batch Delivery.” International Journal of Production Research in press. https://doi.org/10.1080/00207543.2023.2233626.
  • Lei, D. M., B. Su, and M. Li. 2020. “Cooperated Teaching-learning-based Optimisation for Distributed Two-stage Flow Shop Scheduling.” International Journal of Production Research 59 (23): 7232–7245. https://doi.org/10.1080/00207543.2020.1836422.
  • 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 Research58 (2): 597–614. https://doi.org/10.1080/00207543.2019.1598596.
  • Li, J. Q., Y. Y. Han, and C. G. Wang. 2017. “A Hybrid Artificial Bee Colony Algorithm to Solve Multi-objective Hybrid Flowshop in Cloud Computing Systems.” Cloud Computing and Security10602:201–213. https://doi.org/10.1007/978-3-319-68505-2_18.
  • Li, D. N., X. W. Meng, Q. Q. Liang, and J. Q. Zhao. 2015. “A Heuristic-search Genetic Algorithm for Multi-stage Hybrid Flow Shop Scheduling with Single Processing Machines and Batch Processing Machines.” Journal of Intelligent Manufacturing 26 (5): 873–890. https://doi.org/10.1007/s10845-014-0874-y.
  • Li, Z. H., and G. H. Wan. 2023. “Batching and Scheduling in a Continuous-discrete Hybrid Flowshop: Lagrangianrelaxation-based Heuristic Algorithms.” International Journal of Production Research 61 (17): 5934–5955. https://doi.org/10.1080/00207543.2022.2119294.
  • Li, C. H., F. Wang, J. N. D. Gupta, and T. P. Chung. 2022a. “Scheduling Identical Parallel Batch Processing Machines Involving Incompatible Families with Different Job Sizes and Capacity Constraints.” Computers & Industrial Engineering 169:108115. https://doi.org/10.1016/j.cie.2022.108115.
  • Li, K., H. Zhang, C. B. Chu, Z. H. Jia, and J. F. Chen. 2022b. “A Bi-objective Evolutionary Algorithm Scheduled on Uniform Parallel Batch Processing Machines.” Expert Systems with Applications204:117487. https://doi.org/10.1016/j.eswa.2022.117487.
  • Li, K., H. Zhang, C. B. Chu, Z. H. Jia, and Y. Wang. 2022c. “A Bi-objective Evolutionary Algorithm for Minimizing Maximum Lateness and Total Pollution Cost on Non-identical Parallel Batch Processing Machines.” Computers & Industrial Engineering 172:108608. https://doi.org/10.1016/j.cie.2022.108608.
  • Liu, M., X. N. Yang, J. T. Zhang, and C. B. Chu. 2017. “Scheduling a Tempered Glass Manufacturing System: A Three-stage Hybrid Flow Shop Model.” International Journal of Production Research 55 (20): 6084–6107. https://doi.org/10.1080/00207543.2017.1324222.
  • Lu, H., and Q. Fei. 2022. “An Efficient Adaptive Genetic Algorithm for Energy Saving in the Hybrid Flow Shop Scheduling Problem with Batch Production At Last Stage.” Expert Systems 39 (2): 1–15. https://doi.org/10.1111/exsy.12678.
  • Montgomery, D. C. 2019. Design and Analysis of Experiments. New York: Wiley. https://doi.org/10.1007/s10182-010143-0.
  • Oguz, C., Y. Zinder, V. Do, A. Janiak, and M. Lichtenstein. 2004. “Hybrid Flow Shop Scheduling Problems with Multiprocessor Task System.” European Journal of Operational Research 152 (1): 115–131. https://doi.org/10.1016/S0377-2217(02)00644-6.
  • Ou, J. W., L. F. Lu, and X. L. Zhong. 2023. “Parallel-batch Scheduling with Rejection: Structural Properties and Approximation Algorithms.” European Journal of Operational Research 310 (3): 1017–1032. https://doi.org/10.1016/j.ejor.2023.04.019.
  • Pan, Q. K., L. Wang, J. Q. Li, and J. H. Duan. 2014. “A Novel Discrete Artificial Bee Colony Algorithm for the Hybrid Flowshop Scheduling Problem with Makespan Minimisation.” Omega25:42-56. https://doi.org/10.1016/j.omega.2013.12.004.
  • Pan, Q. K., L. Wang, K. Mao, J. H. Zhao, and M. Zhang. 2013. “An Effective Artificial Bee Colony Algorithm for a Real-World Hybrid Flowshop Problem in Steelmaking Process.” IEEE Transactions on Automation Science and Engineering 10 (2): 307–322. https://doi.org/10.1109/TASE.2012.2204874.
  • Peng, K. K., Q. K. Pan, L. Gao, B. Zhang, and X. F. Pang. 2018. “An Improved Artificial Bee Colony Algorithm for Real-world Hybrid Flowshop Rescheduling in Steelmaking-refining-continuous Casting Process.” Computers & Industrial Engineering 122:235-250. https://doi.org/10.1016/j.cie.2018.05.056.
  • Qin, H. X., Y. Y. Han, B. Zhang, L. L. Meng, Y. P. Liu, Q. K. Pan, and D. W. Gong. 2022. “An Improved Iterated Greedy Algorithm for the Energy-efficient Blocking Hybrid Flow Shop Scheduling Problem.” Swarm and Evolutionary Computation 69:100992. https://doi.org/10.1016/j.swevo.2021.100992.
  • Qin, W., Z. L. Zhuang, Y. Liu, and O. Tang. 2019. “A Two-stage Ant Colony Algorithm for Hybrid Flow Shop Scheduling with Lot Sizing and Calendar Constraints in Printed Circuit Board Assembly.” Computers & Industrial Engineering 138:106115. https://doi.org/10.1016/j.cie.2019.106115.
  • Rabiee, M., R. S. Sadeghi, 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. https://doi.org/10.1007/s00170-013-5375-1.
  • Tiacci, L., and A. Ross. 2023. “The Sand-casting Process: A Meta-heuristic Approach for An Environment-friendlyand Profitable Scheduling.” International Journal of Production Researchin press. https://doi.org/10.1080/00207543.2023.2234052.
  • Tremblet, D., S. Thevenin, and A. Dolgui. 2023. “Makespan Estimation in a Flexible Job-shop Scheduling Environment Using Machine Learning.” International Journal of Production Researchin press. https://doi.org/10.1080/00207543.2023.2245918.
  • Wang, R., Z. H. Jia, and K. Li. 2021. “Scheduling Parallel-batching Processing Machines Problem with Learning and Deterioration Effect in Fuzzy Environment.” Journal of Intelligent and Fuzzy Systems 40 (6): 12111–12124. https://doi.org/10.3233/jifs-210196.
  • Wang, S. J., X. D. Wang, and L. Yu. 2019. “Two-stage No-wait Hybrid Flow-shop Scheduling with Sequence-dependent Setup Times.” International Journal of Systems Science: Operations & Logistics 7 (3): 291–307. https://doi.org/10.1080/23302674.2019.1575997.
  • Wu, X. L., and Z. Cao. 2022. “An Improved Multi-objective Evolutionary Algorithm Based on Decomposition for Solving Re-entrant Hybrid Flow Shop Scheduling Problem with Batch Processing Machines.” Computers & Industrial Engineering 159:108236. https://doi.org/10.1016/j.cie.2022.108236.
  • Youssef, Y. A., Y. Beauchamp, and M. Thomas. 1994. “Comparison of a Full Factorial Experiment to Fractional and Taguchi Designs in a Lathe Dry Turning Operation.” Computers and Industrial Engineering 27 (1-4): 59–62. https://doi.org/10.1016/0360-8352(94)90237-2.
  • Zarook, Y., J. Rezaeian, I. Mahdavi, and M. Yaghini. 2021. “Efficient Algorithms to Minimize Makespan of the Unrelated Parallel Batch-processing Machines Scheduling Problem with Unequal Job Ready Times.” Rairo Operations Research 55 (3): 1501–1522. https://doi.org/10.1051/ro/2021062.
  • Zhang, R., P. C. Chang, S. J. Song, and C. Wu. 2017. “A Multi-objective Artificial Bee Colony Algorithm for Parallel Batch-processing Machine Scheduling in Fabric Dyeing Processes.” Knowledge-Based Systems 116:114-129. https://doi.org/10.1016/j.knosys.2016.10.026.
  • Zhang, H., K. Li, C. B. Chu, and Z. H. Jia. 2022. “Parallel Batch Processing Machines Scheduling in Cloud Manufacturing for Minimizing Total Service Completion Time.” Computers & Operations Research 146:105899. https://doi.org/10.1016/j.cor.2022.105899.
  • Zhang, H., K. Li, Z. H. Jia, and C. B. Chu. 2023. “Minimizing Total Completion Time on Non-identical Parallel Batch Machines with Arbitrary Release Times Using Ant Colony Optimization.” European Journal of Operational Research 309 (3): 1024–1046. https://doi.org/10.1016/j.ejor.2023.02.015.
  • Zhang, B., Q. K. Pan, L. Gao, X. Y. Li, L. L. Meng, and K. K. Peng. 2019. “A Multiobjective Evolutionary Algorithm Based on Decomposition for Hybrid Flowshop Green Scheduling Problem.” Computers & Industrial Engineering 136:325-344. https://doi.org/10.1016/j.cie.2019.07.036.
  • Zhang, C. J., J. W. Tan, K. K. Peng, L. Gao, W. M. Shen, and K. L. Lian. 2021. “A Discrete Whale Swarm Algorithm for Hybrid Flow-shop Scheduling Problem with Limited Buffers.” Robotics and Computer-Integrated Manufacturing 68:102081. https://doi.org/10.1016/j.rcim.2020.102081.
  • Zhang, J. M., X. F. Yao, and Y. Li. 2019. “Improved Evolutionary Algorithm for Parallel Batch Processing Machine Scheduling in Additive Manufacturing.” International Journal of Production Research 58 (8): 2263–2282. https://doi.org/10.1080/00207543.2019.1617447.
  • Zheng, S., Z. W. He, Z. Yang, C. B. Chu, and N. M. Wang. 2023. “Effective Upper and Lower Bounds for a Two-stage Reentrant Flexible Flow Shop Scheduling Problem.” Computers and Operations Research153 (C): 106183. https://doi.org/10.1016/j.cor.2023.106183.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.