期刊文献+
共找到258篇文章
< 1 2 13 >
每页显示 20 50 100
Hybrid Flow Shop with Setup Times Scheduling Problem
1
作者 Mahdi Jemmali Lotfi Hidri 《Computer Systems Science & Engineering》 SCIE EI 2023年第1期563-577,共15页
The two-stage hybridflow shop problem under setup times is addressed in this paper.This problem is NP-Hard.on the other hand,the studied problem is modeling different real-life applications especially in manufacturing... The two-stage hybridflow shop problem under setup times is addressed in this paper.This problem is NP-Hard.on the other hand,the studied problem is modeling different real-life applications especially in manufacturing and high performance-computing.Tackling this kind of problem requires the development of adapted algorithms.In this context,a metaheuristic using the genetic algorithm and three heuristics are proposed in this paper.These approximate solutions are using the optimal solution of the parallel machines under release and delivery times.Indeed,these solutions are iterative procedures focusing each time on a particular stage where a parallel machines problem is called to be solved.The general solution is then a concatenation of all the solutions in each stage.In addition,three lower bounds based on the relaxation method are provided.These lower bounds present a means to evaluate the efficiency of the developed algorithms throughout the measurement of the relative gap.An experimental result is discussed to evaluate the performance of the developed algorithms.In total,8960 instances are implemented and tested to show the results given by the proposed lower bounds and heuristics.Several indicators are given to compare between algorithms.The results illustrated in this paper show the performance of the developed algorithms in terms of gap and running time. 展开更多
关键词 Hybridflow shop genetic algorithm setup times HEURISTICS lower bound
下载PDF
Single Machine Scheduling with Time-Dependent Learning Effect and Non-Linear Past-Sequence-Dependent Setup Times 被引量:1
2
作者 Yuling Yeh Chinyao Low Wen-Yi Lin 《Journal of Applied Mathematics and Physics》 2015年第1期10-15,共6页
This paper studies a single machine scheduling problem with time-dependent learning and setup times. Time-dependent learning means that the actual processing time of a job is a function of the sum of the normal proces... This paper studies a single machine scheduling problem with time-dependent learning and setup times. Time-dependent learning means that the actual processing time of a job is a function of the sum of the normal processing times of the jobs already scheduled. The setup time of a job is proportional to the length of the already processed jobs, that is, past-sequence-dependent (psd) setup time. We show that the addressed problem remains polynomially solvable for the objectives, i.e., minimization of the total completion time and minimization of the total weighted completion time. We also show that the smallest processing time (SPT) rule provides the optimum sequence for the addressed problem. 展开更多
关键词 Scheduling TIME-DEPENDENT Learning setup TIME Past-Sequence-Dependent Total COMPLETION TIME
下载PDF
No-Wait Flowshops to Minimize Total Tardiness with Setup Times 被引量:1
3
作者 Tariq Aldowaisan Ali Allahverdi 《Intelligent Control and Automation》 2015年第1期38-44,共7页
The m-machine no-wait flowshop scheduling problem is addressed where setup times are treated as separate from processing times. The objective is to minimize total tardiness. Different dispatching rules have been inves... The m-machine no-wait flowshop scheduling problem is addressed where setup times are treated as separate from processing times. The objective is to minimize total tardiness. Different dispatching rules have been investigated and three were found to be superior. Two heuristics, a simulated annealing (SA) and a genetic algorithm (GA), have been proposed by using the best performing dispatching rule as the initial solution for SA, and the three superior dispatching rules as part of the initial population for GA. Moreover, improved versions of SA and GA are proposed using an insertion algorithm. Extensive computational experiments reveal that the improved versions of SA and GA perform about 95% better than SA and GA. The improved version of GA outperforms the improved version of SA by about 3.5%. 展开更多
关键词 NO-WAIT FLOWSHOP Scheduling setup times Total TARDINESS Simulated Annealing GENETIC Algorithm
下载PDF
A Hybrid Estimation of Distribution Algorithm for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times 被引量:7
4
作者 Ling Wang Shengyao Wang Xiaolong Zheng 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI 2016年第3期235-246,246+236-245,共12页
A hybrid estimation of distribution algorithm (EDA) with iterated greedy (IG) search (EDA-IG) is proposed for solving the unrelated parallel machine scheduling problem with sequence-dependent setup times (UPMSP-SDST).... A hybrid estimation of distribution algorithm (EDA) with iterated greedy (IG) search (EDA-IG) is proposed for solving the unrelated parallel machine scheduling problem with sequence-dependent setup times (UPMSP-SDST). For makespan criterion, some properties about neighborhood search operators to avoid invalid search are derived. A probability model based on neighbor relations of jobs is built in the EDA-based exploration phase to generate new solutions by sampling the promising search region. Two types of deconstruction and reconstruction as well as an IG search are designed in the IG-based exploitation phase. Computational complexity of the algorithm is analyzed, and the effect of parameters is investigated by using the Taguchi method of design-of-experiment. Numerical tests on 1640 benchmark instances are carried out. The results and comparisons demonstrate the effectiveness of the EDA-IG. Especially, the bestknown solutions of 531 instances are updated. In addition, the effectiveness of the properties is also demonstrated by numerical comparisons. © 2014 Chinese Association of Automation. 展开更多
关键词 BENCHMARKING Computational complexity Design of experiments MACHINERY OPTIMIZATION SCHEDULING Taguchi methods
下载PDF
An Improved Ant Colony Algorithm for a Single-machine Scheduling Problem with Setup Times
5
作者 YE Qiang LIU Xinbao LIU Lin YANG Shanglin School of Management,Hefei University of Technology,Hefei 230009,China, 《武汉理工大学学报》 CAS CSCD 北大核心 2006年第S3期956-961,共6页
Motivated by industrial applications we study a single-machine scheduling problem in which all the jobs are mutu- ally independent and available at time zero.The machine processes the jobs sequentially and it is not i... Motivated by industrial applications we study a single-machine scheduling problem in which all the jobs are mutu- ally independent and available at time zero.The machine processes the jobs sequentially and it is not idle if there is any job to be pro- cessed.The operation of each job cannot be interrupted.The machine cannot process more than one job at a time.A setup time is needed if the machine switches from one type of job to another.The objective is to find an optimal schedule with the minimal total jobs’completion time.While the sum of jobs’processing time is always a constant,the objective is to minimize the sum of setup times.Ant colony optimization(ACO)is a meta-heuristic that has recently been applied to scheduling problem.In this paper we propose an improved ACO-Branching Ant Colony with Dynamic Perturbation(DPBAC)algorithm for the single-machine schedul- ing problem.DPBAC improves traditional ACO in following aspects:introducing Branching Method to choose starting points;im- proving state transition rules;introducing Mutation Method to shorten tours;improving pheromone updating rules and introduc- ing Conditional Dynamic Perturbation Strategy.Computational results show that DPBAC algorithm is superior to the traditional ACO algorithm. 展开更多
关键词 DPBAC ALGORITHM ANT COLONY optimization ALGORITHM SINGLE-MACHINE SCHEDULING problem setup time
下载PDF
Identical Machine Scheduling Problem with Sequence-Dependent Setup Times: MILP Formulations Computational Study
6
作者 Farouk Yalaoui Nhan Quy Nguyen 《American Journal of Operations Research》 2021年第1期15-34,共20页
This work aims to give a systematic construction of the two families of mixed-integer-linear-programming (MILP) formulations, which are graph-<span style="font-family:;" "=""> </span&... This work aims to give a systematic construction of the two families of mixed-integer-linear-programming (MILP) formulations, which are graph-<span style="font-family:;" "=""> </span><span style="font-family:Verdana;">based and sequence-based, of the well-known scheduling problem<img src="Edit_41010f25-7ca5-482c-89be-790fad4616e1.png" alt="" /></span><span style="font-family:Verdana;text-align:justify;">. Two upper bounds of job completion times are introduced. A numerical test result analysis is conducted with a two-fold objective 1) testing the performance of each solving methods, and 2) identifying and analyzing the tractability of an instance according to the instance structure in terms of the number of machines, of the jobs setup time lengths and of the jobs release date distribution over the scheduling horizon.</span> <div> <span style="font-family:Verdana;text-align:justify;"><br /> </span> </div> 展开更多
关键词 Identical Machine Scheduling Problem Release Date Sequence Dependent setup Time
下载PDF
A Linear Programming Approach for Parallel Cell Scheduling with Sequence-Dependent Setup Times
7
作者 Tugba Yildiz Besim TurkerOzalp +2 位作者 Ilker Kucukoglu Alkın Yurtkuran Nursel Ozturk 《American Journal of Operations Research》 2014年第3期155-163,共9页
In this study, we consider the problem of scheduling a set of jobs with sequence-dependent setup times on a set of parallel production cells. The objective of this study is to minimize the total completion time. We no... In this study, we consider the problem of scheduling a set of jobs with sequence-dependent setup times on a set of parallel production cells. The objective of this study is to minimize the total completion time. We note that total customer demands for each type should be satisfied, and total required production time in each cell cannot exceed the capacity of the cell. This problem is formulated as an integer programming model and an interface is designed to provide integrity between data and software. Mathematical model is tested by both randomly generated data set and real-world data set from a factory that produce automotive components. As a result of this study, the solution which gives the best alternative production schedule is obtained. 展开更多
关键词 Production Scheduling Total Completion Time Sequence Dependent setup times
下载PDF
设备故障下的零空闲多设备工作中心调度
8
作者 孔继利 冯英杰 《计算机工程与应用》 CSCD 北大核心 2024年第14期306-318,共13页
设备故障是车间调度中最为常见的动态事件,易对原生产调度计划造成影响。为保证加工生产在遇到设备故障后能够快速地对原调度方案做出调整,降低设备故障所带来的负面影响,对设备故障下的零空闲多设备工作中心调度问题进行研究。建立了... 设备故障是车间调度中最为常见的动态事件,易对原生产调度计划造成影响。为保证加工生产在遇到设备故障后能够快速地对原调度方案做出调整,降低设备故障所带来的负面影响,对设备故障下的零空闲多设备工作中心调度问题进行研究。建立了设备故障下考虑调整时间和搬运时间的零空闲多设备工作中心调度模型,优化目标为最小化最大完工时间、搬运次数和系统稳定性;设计NSGA-Ⅱ-V算法用于原调度和重调度的求解;基于NSGA-Ⅱ-V获得的静态调度结果与部分重调度策略的思想,进行设备故障算例测试。测试结果表明,所提模型和算法可较好地处理动态事件为设备故障的零空闲多设备工作中心调度问题。 展开更多
关键词 零空闲多设备工作中心调度 遗传算法 设备故障 调整时间 搬运时间
下载PDF
考虑序列相关准备时间的分布式柔性作业车间调度研究
9
作者 王有远 董博文 《工业工程》 2024年第3期78-86,共9页
针对考虑序列相关准备时间的分布式柔性作业车间调度问题,提出以最小化最大完工时间为优化目标的混合整数线性规划模型,并提出一种改进遗传算法。采用基于负荷均衡的种群初始化方法提高初始种群质量,根据问题特性构造6个局部扰动算子,... 针对考虑序列相关准备时间的分布式柔性作业车间调度问题,提出以最小化最大完工时间为优化目标的混合整数线性规划模型,并提出一种改进遗传算法。采用基于负荷均衡的种群初始化方法提高初始种群质量,根据问题特性构造6个局部扰动算子,设计多重局部扰动策略提高算法的局部搜索能力。通过扩展柔性作业车间调度基准生成测试算例,使用正交实验确定算法参数。实验结果表明,所提改进策略能够有效提高算法性能,求解结果优于对比算法,验证了调度模型和所提算法的可行性和有效性。 展开更多
关键词 分布式柔性作业车间调度 序列相关准备时间 遗传算法 最大完工时间
下载PDF
多目标协同正弦优化算法求解分布式流水车间调度问题
10
作者 郎峻 顾幸生 《控制理论与应用》 EI CAS CSCD 北大核心 2024年第6期1029-1037,共9页
针对最小化最大完工时间(makespan)、总拖期以及平均空闲时间的多目标序列相关准备时间分布式流水车间调度问题,本文提出一种多目标协同正弦优化算法(MCSOA).算法主要包括4个核心阶段:在多邻域搜索阶段,提出了基于关键工厂的搜索策略,... 针对最小化最大完工时间(makespan)、总拖期以及平均空闲时间的多目标序列相关准备时间分布式流水车间调度问题,本文提出一种多目标协同正弦优化算法(MCSOA).算法主要包括4个核心阶段:在多邻域搜索阶段,提出了基于关键工厂的搜索策略,并通过正弦优化算法控制搜索范围;在破坏重构阶段,设计了一种迭代搜索策略引导个体的进化方向,同时使用正弦优化算法平衡全局开发与局部搜索;在选择阶段,使用非支配排序与参考点的方法筛选优质解,外部档案集用于存储所有非支配解;在协同阶段,设计种群间共享与竞争机制,平衡3个目标的优化.本文通过多目标优化的均匀性、反世代距离和覆盖率3项性能指标验证算法的有效性,并使用非参数检验证明所提出的算法具有显著性优势. 展开更多
关键词 多目标优化 分布式流水车间调度 序列相关准备时间 正弦优化算法 协同优化
下载PDF
Scheduling a three-machine no-wait flowshop with separated setup time 被引量:1
11
作者 常俊林 邵惠鹤 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2006年第2期206-210,共5页
In many practical flowshop production environments, there is no intermediate storage space available to keep partially completed jobs between any two machines. The workflow has to be continuous, implying that the no-w... In many practical flowshop production environments, there is no intermediate storage space available to keep partially completed jobs between any two machines. The workflow has to be continuous, implying that the no-wait conditions must be abided, which is typical in steel and plastic production. We discuss the three-machine no-wait flowshop scheduling problem where the setup times are considered as separated from processing times and sequence independent. The scheduling goal is to minimize the total flowtime. An optimal property and two heuristic algorithms for this problem are proposed. Evaluated over a large number of problems, the proposed heuristics are found that they can yield good solutions effectively with low computational complexity, and have more obvious advantage for the large size problem compared with the existing one. 展开更多
关键词 three-machine flowshop setup time NO-WAIT total flow time
下载PDF
交换突变策略改进萤火虫算法的异构并行机调度
12
作者 罗冬梅 陈玲清 +1 位作者 张瑀鑫 黄兴旺 《集美大学学报(自然科学版)》 CAS 2023年第2期177-184,共8页
序列相关设置时间的异构并行机调度问题是个NP(non-deterministic polynomial)问题,在高纬度情况下难以求解。选取任务完工时间为优化目标建立数学模型,提出一种基于交换突变策略改进的萤火虫算法,并应用该算法进行求解,以期在可接受的... 序列相关设置时间的异构并行机调度问题是个NP(non-deterministic polynomial)问题,在高纬度情况下难以求解。选取任务完工时间为优化目标建立数学模型,提出一种基于交换突变策略改进的萤火虫算法,并应用该算法进行求解,以期在可接受的时间内提供近似最优解的可行方案。实验结果表明,所提出的算法在处理异构并行机调度问题时具有较突出的全局搜索优势,收敛速度较快,搜索精度高,测算了36个算例,其中的28个取得最优平均解,并且较萤火虫算法、模拟退火算法和遗传算法分别减少了11.12%、7.36%和1.43%的平均任务完工时间。 展开更多
关键词 异构并行机调度 萤火虫算法 交换突变 任务完工时间 序相关设置时间
下载PDF
考虑多时间因素的绿色可重入混合流水车间调度问题 被引量:4
13
作者 耿凯峰 叶春明 《计算机集成制造系统》 EI CSCD 北大核心 2023年第1期75-90,共16页
针对同时考虑顺序相关调整时间和运输时间等多时间因素的绿色可重入混合流水车间调度问题(GRHFSP-MTF),以最小化最大完工时间和总能耗为目标建立双目标优化模型。针对GRHFSP-MTF的特点,提出一种混合文化基因算法(HMA)。首先,提出了基于... 针对同时考虑顺序相关调整时间和运输时间等多时间因素的绿色可重入混合流水车间调度问题(GRHFSP-MTF),以最小化最大完工时间和总能耗为目标建立双目标优化模型。针对GRHFSP-MTF的特点,提出一种混合文化基因算法(HMA)。首先,提出了基于工序、机器和转速的三层编码策略;然后,设计了基于贪婪机器选择和完全随机的种群初始化方法、交叉和变异算子以及5种邻域搜索算子;最后,在不改变机器分配和工件排列的前提下,基于降低机器转速手段设计了节能算子。大量仿真实验表明,HMA可以有效地求解考虑多时间因素的绿色可重入混合流水车间调度问题,并具有较强的优越性。 展开更多
关键词 可重入混合流水车间调度 绿色调度 顺序相关调整时间 运输时间 多时间因素
下载PDF
改进混合多目标蚁群算法求解带运输时间和调整时间的柔性作业车间调度问题 被引量:3
14
作者 张国辉 闫少峰 +1 位作者 陆熙熙 张海军 《计算机应用研究》 CSCD 北大核心 2023年第12期3690-3695,共6页
柔性作业车间调度问题是一类重要的组合优化问题,实际生产过程中,产品搬运、机床换模、更换刀具等间接加工活动中存在运输时间和调整时间,会对生产周期产生影响。研究了同时考虑运输时间和调整时间的柔性作业车间调度问题,建立以最小化... 柔性作业车间调度问题是一类重要的组合优化问题,实际生产过程中,产品搬运、机床换模、更换刀具等间接加工活动中存在运输时间和调整时间,会对生产周期产生影响。研究了同时考虑运输时间和调整时间的柔性作业车间调度问题,建立以最小化最大完工时间、机器总负载、机器关键负载和工件的交货期惩罚值为目标的数学模型,并提出一种改进的混合多目标蚁群算法。结合问题特征和算法特点设计了一种分布式编码方式,采用改进蚁群算法分别搜索各优化目标的最优调度方案,针对调度方案集进行非支配排序选择,为了提高算法的搜索精度,提出了突变和靠拢操作。最后通过基准实例和生产实例进行仿真实验,并与改进遗传算法、MOGATS算法进行对比,实验结果表明提出的改进混合多目标蚁群算法是有效和可行的。 展开更多
关键词 改进蚁群算法 运输时间 调整时间 柔性作业车间调度问题
下载PDF
基于多动作深度强化学习的纺机制造车间调度方法 被引量:1
15
作者 纪志勇 袁逸萍 +2 位作者 巴智勇 樊盼盼 田芳 《计算机应用研究》 CSCD 北大核心 2023年第11期3247-3253,共7页
纺机制造车间调度问题是一种具有复杂工艺约束和序列相关设置时间的柔性作业车间调度问题,为了保证调度方案的质量,提升企业的订单准时交付能力,提出了一种以最小化最大完工期为优化目标的多动作深度强化学习算法。首先,将调度问题建模... 纺机制造车间调度问题是一种具有复杂工艺约束和序列相关设置时间的柔性作业车间调度问题,为了保证调度方案的质量,提升企业的订单准时交付能力,提出了一种以最小化最大完工期为优化目标的多动作深度强化学习算法。首先,将调度问题建模为多马尔可夫决策过程。然后,针对纺机制造车间调度的工件选择和机器选择两个子问题,分别设计了用于定义工序选择策略和机器选择策略的两个编码器,以预测选择不同工序和机器的概率分布。其中,在工序选择编码器中,采用图神经网络对析取图进行编码,以降低问题规模对解的质量的影响。其次,提出了一种具有多动作空间的强化学习训练算法,用于学习两个子策略。最后,经某纺机制造企业的实际生产案例验证,该方法的性能受问题规模影响较小,与其他对比算法相比,能够获得较高质量的调度方案,训练的模型具有较好的泛化能力和稳定性。 展开更多
关键词 纺机制造车间调度 序列相关设置时间 深度强化学习 图神经网络 多近端策略优化算法 最大完工期
下载PDF
基于时间窃取的数字电路时序优化方法
16
作者 冯善亮 杨兵 陈亮 《微电子学与计算机》 2023年第8期114-124,共11页
在大规模数字集成电路设计中,时序分析是签核(Signoff)的关键一环,目前电路设计中主要通过关键路径优化使电路时序达到要求,但这类方法可能会使电路结构发生改变,电路版图也要进行大量更改,延长了芯片设计周期.为能快速解决电路时序修... 在大规模数字集成电路设计中,时序分析是签核(Signoff)的关键一环,目前电路设计中主要通过关键路径优化使电路时序达到要求,但这类方法可能会使电路结构发生改变,电路版图也要进行大量更改,延长了芯片设计周期.为能快速解决电路时序修正问题,提出了一种基于动态电路设计思想的时移触发器,此触发器去除了建立(Setup)时间,基于SMIC40 nm工艺完成电路设计和仿真,进行了触发器标准单元版图绘制,通过合理分配参数,时序参数优于标准单元库中的D触发器.不同工艺角(Process,Voltage,Temperature,PVT)仿真表明,在典型情况下,时移触发器相比于SMIC40 nm标准单元库中相同驱动能力的D触发器输出响应时间加速比达到188.6%.结合所设计的时移触发器和时间窃取(Timing Borrow)方法,分析了数字电路中时序分配情况,所设计的触发器可应用于工程更改计划(Engineering Change Order,ECO)阶段进行数字电路时序修复和优化,可减少时钟树和逻辑电路调整,有效缩短数字电路芯片设计周期. 展开更多
关键词 D触发器 时序电路 时序修复 setup时间
下载PDF
Performance Assessment and Configuration Analysis in the Study of SCADA System (Supervisory Control and Data Acquisition)
17
作者 R.Vanalakshmi S.Maragathasundari +2 位作者 M.Kameswari B.Balamurugan C.Swedheetha 《Intelligent Automation & Soft Computing》 SCIE 2023年第8期1399-1419,共21页
Queuing models are used to assess the functionality and aesthetics of SCADA systems for supervisory control and data collection.Here,the main emphasis is on how the queuing theory can be used in the system’s design a... Queuing models are used to assess the functionality and aesthetics of SCADA systems for supervisory control and data collection.Here,the main emphasis is on how the queuing theory can be used in the system’s design and analysis.The analysis’s findings indicate that by using queuing models,cost-performance ratios close to the ideal might be attained.This article discusses a novel methodology for evaluating the service-oriented survivability of SCADA systems.In order to evaluate the state of service performance and the system’s overall resilience,the framework applies queuing theory to an analytical model.As a result,the SCADA process is translated using the M^(X)/G/1 queuing model,and the queueing theory is used to evaluate this design’s strategy.The supplemental variable technique solves the queuing problem that comes with the subsequent results.The queue size,server idle time,utilization,and probabilistic generating factors of the distinct operating strategies are estimated.Notable examples were examined via numerical analysis using mathematical software.Because it is used frequently and uses a statistical demarcation method,this tactic is completely acceptable.The graphical representation of this perspective offers a thorough analysis of the alleged limits. 展开更多
关键词 SCADA system queuing model compulsory vacation setup time stage feedback service supplementary variable technique
下载PDF
一种基于PI控制的数字低压差稳压器高速可调节模型
18
作者 吕生平 耿嘉蓉 +1 位作者 张洪达 陈志杰 《太赫兹科学与电子信息学报》 2023年第8期1059-1064,共6页
数字低压差线性稳压器由于可以在低电源电压下工作而被广泛使用。在数字低压差线性稳压器中,其利用模数转换器和积分器进行稳压操作。但是当负载出现瞬态电压变化,其稳定时间将会很长。在PI控制系统中,积分系数大的电路建立时间很短,会... 数字低压差线性稳压器由于可以在低电源电压下工作而被广泛使用。在数字低压差线性稳压器中,其利用模数转换器和积分器进行稳压操作。但是当负载出现瞬态电压变化,其稳定时间将会很长。在PI控制系统中,积分系数大的电路建立时间很短,会产生过冲,然后输出才会稳定。积分系数小的模型输出可以直接稳定,但是建立时间太长。提出了一种高速可调节电路模型,目的是利用电压传感器和时间数字转换器(TDC),并在电路中加入2种不同积分系数的积分器。首先利用电压传感器和时间数字转换技术(TDCT)实现模数转换以得到数字信号。随后判断数字信号与基准电压,在误差很大时,控制电路选择大积分系数,输出到PI控制;误差小时,控制电路选择小的积分系数,这样可以使电路结合不同积分系数电路的优点,从而达到同时缩短电路建立时间和稳定时间的目的。 展开更多
关键词 数字低压差线性稳压器 PI控制 建立时间 稳定时间 模拟集成电路
下载PDF
Neighborhood Combination Search for Single-Machine Scheduling with Sequence-Dependent Setup Time
19
作者 刘晓路 徐宏云 +3 位作者 陈嘉铭 苏宙行 吕志鹏 丁俊文 《Journal of Computer Science & Technology》 SCIE EI CSCD 2024年第3期737-752,共16页
In a local search algorithm,one of its most important features is the definition of its neighborhood which is crucial to the algorithm's performance.In this paper,we present an analysis of neighborhood combination... In a local search algorithm,one of its most important features is the definition of its neighborhood which is crucial to the algorithm's performance.In this paper,we present an analysis of neighborhood combination search for solv-ing the single-machine scheduling problem with sequence-dependent setup time with the objective of minimizing total weighted tardiness(SMSWT).First,We propose a new neighborhood structure named Block Swap(B1)which can be con-sidered as an extension of the previously widely used Block Move(B2)neighborhood,and a fast incremental evaluation technique to enhance its evaluation efficiency.Second,based on the Block Swap and Block Move neighborhoods,we present two kinds of neighborhood structures:neighborhood union(denoted by B1UB2)and token-ring search(denoted by B1→B2),both of which are combinations of B1 and B2.Third,we incorporate the neighborhood union and token-ring search into two representative metaheuristic algorithms:the Iterated Local Search Algorithm(ILSnew)and the Hybrid Evolutionary Algorithm(HEA_(new))to investigate the performance of the neighborhood union and token-ring search.Exten-sive experiments show the competitiveness of the token-ring search combination mechanism of the two neighborhoods.Tested on the 120 public benchmark instances,our HEA_(new)has a highly competitive performance in solution quality and computational time compared with both the exact algorithms and recent metaheuristics.We have also tested the HEA,new algorithm with the selected neighborhood combination search to deal with the 64 public benchmark instances of the single-machine scheduling problem with sequence-dependent setup time.HEAnew is able to match the optimal or the best known results for all the 64 instances.In particular,the computational time for reaching the best well-known results for five chal-lenging instances is reduced by at least 61.25%. 展开更多
关键词 single-machine scheduling sequence-dependent setup time neighborhood combination search token-ring search hybrid evolutionary algorithm
原文传递
Two-Stage Adaptive Memetic Algorithm with Surprisingly Popular Mechanism for Energy-Aware Distributed Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time
20
作者 Feng Chen Cong Luo +1 位作者 Wenyin Gong Chao Lu 《Complex System Modeling and Simulation》 EI 2024年第1期82-108,共27页
This paper considers the impact of setup time in production scheduling and proposes energy-aware distributed hybrid flow shop scheduling problem with sequence-dependent setup time(EADHFSP-ST)that simultaneously optimi... This paper considers the impact of setup time in production scheduling and proposes energy-aware distributed hybrid flow shop scheduling problem with sequence-dependent setup time(EADHFSP-ST)that simultaneously optimizes the makespan and the energy consumption.We develop a mixed integer linear programming model to describe this problem and present a two-stage adaptive memetic algorithm(TAMA)with a surprisingly popular mechanism.First,a hybrid initialization strategy is designed based on the two optimization objectives to ensure the convergence and diversity of solutions.Second,multiple population co-evolutionary approaches are proposed for global search to escape from traditional cross-randomization and to balance exploration and exploitation.Third,considering that the memetic algorithm(MA)framework is less efficient due to the randomness in the selection of local search operators,TAMA is proposed to balance the local and global searches.The first stage accumulates more experience for updating the surprisingly popular algorithm(SPA)model to guide the second stage operator selection and ensures population convergence.The second stage gets rid of local optimization and designs an elite archive to ensure population diversity.Fourth,five problem-specific operators are designed,and non-critical path deceleration and right-shift strategies are designed for energy efficiency.Finally,to evaluate the performance of the proposed algorithm,multiple experiments are performed on a benchmark with 45 instances.The experimental results show that the proposed TAMA can solve the problem effectively. 展开更多
关键词 distributed hybrid flow shop setup time multiple population ENERGY-AWARE memetic algorithm surprisingly popular algorithm
原文传递
上一页 1 2 13 下一页 到第
使用帮助 返回顶部