174
Views
0
CrossRef citations to date
0
Altmetric
Research Articles

A modified memetic algorithm with multi-operation precise joint movement neighbourhood structure for the assembly job shop scheduling problem

, &
Pages 6292-6324 | Received 02 Aug 2023, Accepted 23 Jan 2024, Published online: 21 Feb 2024

References

  • Balas, E., and Vazacopoulos A. 1998. “Guided Local Search with Shifting Bottleneck for Job Shop Scheduling.” Management Science 44 (2): 262–275. https://doi.org/10.1287/mnsc.44.2.262.
  • Cheng, T. C. E., B. Peng, and Z. Lu. 2016. “A Hybrid Evolutionary Algorithm to Solve the Job Shop Scheduling Problem.” Annals of Operations Research 242 (2): 223–237. https://doi.org/10.1007/s10479-013-1332-5.
  • Cheng, L., Q. Tang, L. Zhang, and Z. Li. 2022. “Inventory and Total Completion Time Minimization for Assembly Job-shop Scheduling Considering Material Integrity and Assembly Sequential Constraint.” Journal of Manufacturing Systems 65: 660–672. https://doi.org/10.1016/j.jmsy.2022.10.013.
  • Dileeplal, J. 2012. Multi-objective Assembly Job Shop Scheduling Using Genetic Algorithm and Tabu Search. Cochin: Cochin University of Science & Technology.
  • Gong, G. L., Q. W. Deng, R. Chiong, X. R. Gong, and H. Z. Y. Huang. 2019. “An Effective Memetic Algorithm for Multi-objective Job-shop Scheduling.” Knowledge-Based Systems 182: 104840. https://doi.org/10.1016/j.knosys.2019.07.011.
  • Guo, W., Q. Lei, Y. Song, and X. Lyu. 2021. “A Learning Interactive Genetic Algorithm Based on Edge Selection Encoding for Assembly Job Shop Scheduling Problem.” Computers & Industrial Engineering 159: 107455. https://doi.org/10.1016/j.cie.2021.107455.
  • Kim, J.-U., and Y.-D. Kim. 1996. “Simulated Annealing and Genetic Algorithms for Scheduling Products with Multi-level Product Structure.” Computers & Operations Research 23 (9): 857–868. https://doi.org/10.1016/0305-0548(95)00079-8.
  • Lei, Q., W. Guo, and Y. Song. 2018. “Integrated Scheduling Algorithm Based on an Operation Relationship Matrix Table for Tree-structured Products.” International Journal of Production Research 56 (16): 5437–5456. https://doi.org/10.1080/00207543.2018.1442942.
  • Lu, H. L., G. Q. Huang, and H. D. Yang. 2011. “Integrating Order Review/Release and Dispatching Rules for Assembly Job Shop Scheduling Using a Simulation Approach.” International Journal of Production Research 49 (3): 647–669. https://doi.org/10.1080/00207540903524490.
  • Lu, C., B. Zhang, L. Gao, J. Yi, and J. Mou. 2022. “A Knowledge-Based Multiobjective Memetic Algorithm for Green Job Shop Scheduling With Variable Machining Speeds.” IEEE Systems Journal 16 (1): 844–855. https://doi.org/10.1109/JSYST.2021.3076481.
  • Maxwell, W. L., and M. Mehra. 1968. “Multiple-Factor Rules for Sequencing with Assembly Constraints.” Naval Research Logistics Quarterly 15 (2): 241–254. https://doi.org/10.1002/nav.3800150209.
  • Meng, R., Y. Rao, Y. Zheng, and D. Qi. 2018. “Modelling and Solving Algorithm for Two-stage Scheduling of Construction Component Manufacturing with Machining and Welding Process.” International Journal of Production Research 56 (19): 6378–6390. https://doi.org/10.1080/00207543.2017.1349949.
  • Qiao, L. H., Z. W. Zhang, and Z. C. Huang. 2021. “A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process Route.” Applied Sciences-Basel 11 (11): 5078.
  • Reeja, M. K., and C. Rajendran. 2000. “Dispatching Rules for Scheduling in Assembly Jobshops – Part 1.” International Journal of Production Research 38 (9): 2051–2066. https://doi.org/10.1080/002075400188492.
  • Segura, C., C. A. C. Coello, E. Segredo, and A. H. Aguirre. 2016. “A Novel Diversity-Based Replacement Strategy for Evolutionary Algorithms.” IEEE Transactions on Cybernetics 46 (12): 3233–3246. https://doi.org/10.1109/TCYB.2015.2501726.
  • Shi, F., and S. K. Zhao. 2017. “Product Comprehensive Scheduling Problems Solved by Genetic Algorithm Based on Operation Constraint Chain Coding.” China Mechanical Engineering 28 (20): 2483–2492.
  • Shi, F., S. Zhao, and Y. Meng. 2020. “Hybrid Algorithm Based on Improved Extended Shifting Bottleneck Procedure and GA for Assembly Job Shop Scheduling Problem.” International Journal of Production Research 58 (9): 2604–2625. https://doi.org/10.1080/00207543.2019.1622052.
  • Taguchi, G., G. Taguchi, and A. P. Organization. 1986. Introduction to Quality Engineering: Designing Quality into Products and Processes. MARION, USA.
  • Varela, D., and J. Santos. 2020. “Protein Structure Prediction in an Atomic Model with Differential Evolution Integrated with the Crowding Niching Method.” Natural Computing 21 (4): 537–551.
  • Wang, F. J., G. K. Zhao, Z. Y. Jia, X. H. Lu, and L. P. Wang. 2010. “Assembly Job Shop Scheduling Based on Feasible Solution Space Genetic Algorithm.” Computer Integrated Manufacturing Systems 16 (01): 115–120.
  • Xie, Z. Q., Y. Xin, and J. Yang. 2011. “Machine-driven Integrated Scheduling Algorithm with Rollback-Preemptive.” Acta Automatica Sinica 37 (11): 1332–1343.
  • Xie, Z. Q., J. Yang, Y. Zhou, D. l. Zhang, and G. y. Tan. 2011. “Dynamic Critical Paths Multi Product Manufacturing Scheduling Algorithm Based on Operation Set.” Chinese Journal of Computers 34 (2): 406–412. https://doi.org/10.3724/SP.J.1016.2011.00406.
  • Xie, Z., X. Zhang, Y. Gao, and Y. Xin. 2018a. “Time-selective Integrated Scheduling Algorithm Considering The Compactness of Serial Processes.” Journal of Mechanical Engineering 54 (6): 191–202. https://doi.org/10.3901/JME.2018.06.191.
  • Xie, Z., X. Zhang, X. Yu, and Y. Jing. 2018b. “Time-selective Integrated Scheduling Algorithm Considering Posterior Processes.” Acta Automatica Sinica 44 (02): 344–362.
  • Xie, Z., W. Zhou, and J. Wang. 2022. “Resource Cooperative Integrated Scheduling Algorithm Based on Sub-Tree Cycle Decomposition of Process Tree.” Journal of Mechanicalengineering 58 (13): 228–239.
  • Xie, Z., W. Zhou, and J. Yang. 2022. “Resource Cooperative Integrated Scheduling Algorithm Considering Hierarchical Scheduling Order.” Computer Integrated Manufacturing Systems 28 (11): 3391–3402.
  • Zhang, C., X. Dong, X. Wang, X. Li, and Q. Liu. 2010. “Improved NSGA-II for the Multi-Objective Flexible Job-Shop Scheduling Problem.” Journal of Mechanical Engineering 46 (11): 156–164. https://doi.org/10.3901/JME.2010.11.156.
  • Zhang, C., P. Li, Z. Guan, and Y. Rao. 2007. “A Tabu Search Algorithm with a New Neighborhood Structure for the Job Shop Scheduling Problem.” Computers & Operations Research 34 (11): 3229–3242. https://doi.org/10.1016/j.cor.2005.12.002.
  • Zhang, C. Y., P. Li, Y. Rao, and Z. Guan. 2008. “A Very Fast TS/SA Algorithm for the Job Shop Scheduling Problem.” Computers & Operations Research 35 (1): 282–294. https://doi.org/10.1016/j.cor.2006.02.024.
  • Zhang, B., Q.-k. Pan, L.-l. Meng, C. Lu, J.-h. Mou, and J.-q. Li. 2022. “An Automatic Multi-Objective Evolutionary Algorithm for the Hybrid Flowshop Scheduling Problem with Consistent Sublots.” Knowledge-Based Systems 238: 107819. https://doi.org/10.1016/j.knosys.2021.107819.
  • Zhao, S. 2020. “Research on Multi-Operation Joint Movement Neighborhood Structure of Job Shop Scheduling Problem.” Journal of Mechanical Engineering 56 (13): 192–206. https://doi.org/10.3901/JME.2020.13.032.
  • Zhao, S., l. Huang, and J. Lu. 2022. “Research on Strengthening Multi-Operation Joint Movement Neighborhood Structure and Approximate Evaluation of Job Shop Scheduling Problem.” Journal of Mechanical Engineering 59 (04): 318–331.
  • Zhu, Z., X. Zhou, D. Cao, and M. Li. 2022. “A Shuffled Cellular Evolutionary Grey Wolf Optimizer for Flexible job Shop Scheduling Problem with Tree-Structure job Precedence Constraints.” Applied Soft Computing 125: 109235. https://doi.org/10.1016/j.asoc.2022.109235.
  • Zou, P., M. Rajora, and S. Y. Liang. 2018. “A New Algorithm Based on Evolutionary Computation for Hierarchically Coupled Constraint Optimization: Methodology and Application to Assembly Job-Shop Scheduling.” Journal of Scheduling 21 (5): 545–563. https://doi.org/10.1007/s10951-018-0572-2.

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.