<?xml version="1.1" encoding="utf-8"?>
<article xsi:noNamespaceSchemaLocation="http://jats.nlm.nih.gov/publishing/1.1/xsd/JATS-journalpublishing1-mathml3.xsd" dtd-version="1.1" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><front><journal-meta><journal-id journal-id-type="publisher-id">ASDS</journal-id><journal-title-group><journal-title>Applied Statistics and Data Science</journal-title></journal-title-group><issn>3066-8433</issn><eissn>3066-8441</eissn><publisher><publisher-name>Art and Technology</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.61369/ASDS.2026100011</article-id><article-categories><subj-group subj-group-type="heading"><subject>Article</subject></subj-group></article-categories><title>考虑设备转运与购置决策的多车间协同整修调度研究</title><url>https://artdesignp.com/journal/ASDS/2/10/10.61369/ASDS.2026100011</url><author>魏陆炀</author><pub-date pub-type="publication-year"><year>2026</year></pub-date><volume>2</volume><issue>10</issue><history><date date-type="pub"><published-time>2026-10-20</published-time></date></history><abstract>针对多车间整修中工序衔接、移动设备竞争与设备增购的耦合问题，建立以最大完工时间最小化为目标的资源约束调度模型。将五车间重复工艺展开为27道工序，描述同类设备并行、异类设备协同、分项释放及跨车间转运。在同步开工和设备能力线性叠加假设下，分别采用粒子群、遗传和蚁群算法求解单班组、双班组与预算购置情景。三种方案工期分别为159574、82180和54360 s，后两者较前一情景缩短48.50% 和33.85%。购置方案在50万元预算内增购9台设备，支出48万元。抛光与检测设备是基准情景的紧缺资源，增购后末完工车间由C 转为E。明细核验支持排程可行性，但尚不能证明全局最优或算法优越性。研究为可分工程量和移动设备共享条件下的整修规划提供了分析方法。</abstract><keywords>多车间整修,资源约束调度,设备转运,设备购置,启发式算法</keywords></article-meta></front><body/><back><ref-list><ref id="B1" content-type="article"><label>1</label><element-citation publication-type="journal"><p>[1]HARTMANN S, BRISKORN D. An updated survey of variants and extensions of the resource-constrained project scheduling problem[J]. European Journal of Operational Research, 2022, 297(1): 1-14.[2]DING H, ZHUANG C, LIU J. Extensions of the resource-constrained project scheduling problem[J]. Automation in Construction, 2023, 153: 104958.[3]G&amp;Oacute;MEZ S&amp;Aacute;NCHEZ M, LALLA-RUIZ E, FERN&amp;Aacute;NDEZ GIL A, et al. Resource-constrained multi-project scheduling problem: A survey[J]. European Journal of Operational Research, 2023, 309(3): 958-976.[4]DAUZ&amp;Egrave;RE-P&amp;Eacute;R&amp;Egrave;S S, DING J, SHEN L, et al. The flexible job shop scheduling problem: A review[J]. European Journal of Operational Research, 2024, 314(2): 409-432.[5]YAN J, LIU Z, ZHANG C, et al. Research on flexible job shop scheduling under finite transportation conditions for digital twin workshop[J]. Robotics and Computer-Integrated Manufacturing, 2021, 72: 102198.[6]BERTEROTTI&amp;Egrave;RE L, DAUZ&amp;Egrave;RE-P&amp;Eacute;R&amp;Egrave;S S, YUGMA C. Flexible job-shop scheduling with transportation resources[J]. European Journal of Operational Research, 2024,312(3): 890-909.[7] 张国辉, 蔡翌豪, 李志霄, 等. 考虑有限AGV 运输资源的柔性作业车间调度研究[J]. 中国机械工程,2025,36(8):1811-1823.[8]FAN J, ZHANG C, LIU Q, et al. An improved genetic algorithm for flexible job shop scheduling problem considering reconfigurable machine tools with limited auxiliary modules[J].Journal of Manufacturing Systems, 2022, 62: 650-667.[9]CHEN R, WU B, WANG H, et al. A Q-Learning based NSGA-II for dynamic flexible job shop scheduling with limited transportation resources[J]. Swarm and Evolutionary Computation, 2024, 90: 101658.[10]KENNEDY J, EBERHART R. Particle swarm optimization[C]//Proceedings of ICNN&amp;rsquo;95 - International Conference on Neural Networks. Perth, WA, Australia: IEEE,1995, 4: 1942-1948.[11]DORIGO M, GAMBARDELLA L M. Ant colony system: A cooperative learning approach to the traveling salesman problem[J]. IEEE Transactions on EvolutionaryComputation, 1997, 1(1): 53-66.[12]DESTOUET C, TLAHIG H, BETTAYEB B, et al. Flexible job shop scheduling problem under Industry 5.0: A survey on human reintegration, environmental consideration and resilience improvement[J]. Journal of Manufacturing Systems, 2023, 67: 155-173.</p><pub-id pub-id-type="doi"/></element-citation></ref></ref-list></back></article>
