检索结果-南通市图书馆

Neighborhood Combination Search for single-machine scheduling with Sequence-Dependent Setup Time

Journal of Computer Science & Technology 2024年第3期39卷 737-752页

作者：刘晓路徐宏云陈嘉铭苏宙行吕志鹏丁俊文 College of System Engineering National University of Defense TechnologyChangsha 410015China School of Artificial Intelligence Jianghan UniversityWuhan 430056China Xi’an Satellite Control Center Xi’an 710043China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China CCF

In a local search algorithm,one of its most important features is the definition of its neighborhood which is crucial to the algorithm's *** 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 ***,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 ***,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 ***-sive experiments show the competitiveness of the token-ring search combination mechanism of the two *** 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 *** 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 *** is able to match the optimal or the best known results for all the 64 *** 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

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing

引用

Journal of Management Science and Engineering 2023年第2期8卷 273-286页

作者： Lindong Liu Zhenyu Wu Yugang Yu School of Management University of Science and Technology of ChinaHefei230026China

Additive manufacturing(AM)has attracted significant attention in recent years based on its wide range of applications and growing *** offers the advantages of production flexibility and design *** this study,we considered a practical variant of the batch-processing-machine(BPM)scheduling problem that arises in AM industries,where an AM machine can process multiple parts simultaneously,as long as the twodimensional rectangular packing constraint is not *** on the set-partitioning formulation of our mixed-integer programming(MIP)model,a branch-and-price(B&P)algorithm was developed by embedding a column-generation technique into a branchand-bound ***,a novel labelling algorithm was developed to accelerate the column-generation *** is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM *** tested the performance of our algorithm using a modern MIP solver(Gurobi)and real data from a 3D printing *** results demonstrate that for most instances tested,our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.

关键词： single-machine scheduling Branch and price Labelling algorithm Additive manufacturing

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

single-machine scheduling with preventive periodic maintenance and resumable jobs in remanufacturing system

引用

Journal of Southeast University(English Edition) 2012年第3期28卷 349-353页

作者：刘碧玉陈伟达东南大学经济管理学院南京211189 安徽工业大学管理科学与工程学院马鞍山243000

A single-machine scheduling with preventive periodic maintenance activities in a remanufacturing system including resumable and non-resumable jobs is *** objective is to find a schedule to minimize the makespan and an LPT-LS algorithm is ***-resumable jobs are first scheduled in a machine by the longest processing time（LPT） rule,and then resumable jobs are scheduled by the list scheduling（LS） *** the worst-case ratios of this algorithm in three different cases in terms of the value of the total processing time of the resumable jobs（denoted as S2） are *** S2 is longer than the spare time of the machine after the non-resumable jobs are assigned by the LPT rule,it is equal to *** S2 falls in between the spare time of the machine by the LPT rule and the optimal schedule rule,it is less than *** S2 is less than the spare time of the machine by the optimal schedule rule,it is less than ***,numerical examples are presented for verification.

关键词： single-machine scheduling preventive periodic maintenance resumable jobs LPT-LS algorithm

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

single-machine scheduling Problem in Plate Hot Rolling Production

Single-machine Scheduling Problem in Plate Hot Rolling Produ...

引用

2009中国控制与决策会议

作者： Yu Chunyue~1,Xu Meirong~1 Zhao Ruiguo~2 1 Key Laboratory of Process Industry Automation of MOE &Liaoning Province,Northeastern University,Shenyang 110004,China 2.LiaoNing Urban Construction School,Shenyang 110015,China

Plate hot rolling scheduling is a type of single-machine scheduling problem with waiting time constraints and finite buffer *** aim is to determine when the plate is rolled,decrease the mill idle time and increase mill *** scheduling methods,*** alternate scheduling method,symmetry alternate scheduling method and group alternate scheduling method are *** every scheduling method,start rolling time interval and mill utilization formulas are given *** parameters of the formulas should be adjusted according to the roll table *** on the three scheduling methods,a heuristic scheduling approach is proposed for the plate hot rolling scheduling *** examples demonstrated the application of the heuristic scheduling approach.

关键词： single-machine scheduling Waiting Time Finite Buffer Capacity Heuristic Approach

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：