检索结果-内蒙古大学图书馆

第35届中国控制与决策会议

作者： Qianhui Ji Yuyan Han Yuhang Wang Yizheng Wang School of Computer Science Liaocheng University

Owing to the needs of production technology,the demand for group scheduling models will further increase to save costs and ***,the flowshop group scheduling problem(FGSP) has attracted a lot of attention,and is of theoretical significance for academic discussion and practical *** this paper,we consider a distributed FGSP with blocking constrain(DBFGSP).First,a mathematical model of DBFGSP with makespan criterion is formulated and an upgraded iterative greedy algorithm based on intra-group and inter-group operations(UIG) is developed to increase the solution diversity and balance global and local search *** numerical simulation of 810 test cases and statistical comparisons with four representative algorithms,it is verified that the proposed UIG algorithm can obtain good scheduling schemes for DBFGSP.

关键词： flowshop group scheduling distributed blocking makespan iterated greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

An iterated greedy algorithm for Distributed Blocking Flowshop Problems with Makespan Minimization

An Iterated Greedy Algorithm for Distributed Blocking Flowsh...

引用

第三十九届中国控制会议

作者： Shuai Chen Quan-ke Pan XiaoLu Hu M Fatih Tasgetiren School of Mechanical and Electrical Engineering and Automation Shanghai University China Rural Technology Development Center International logistics management department Yasar University

In this paper, we study a distributed blocking flowshop scheduling problem（DBFSP） that is an extension of the traditional blocking flowshop scheduling problem（BFSP）, in which an additional decision of which factory to process each job. We propose an iterated greedy（IG） algorithm to minimize makespan among all the factories. First of all, an effective initialization method based on the PW algorithm is used in order to make better use the problem-specific characteristics. Then, an enhanced construction method is developed to further improve the solution obtained at each iteration. At last, after calibration of algorithm parameters, comparison of algorithms is carried out using the well-known 720 instances from the literature. The results demonstrate the effectiveness of the proposed IG algorithm for solving the DBFSP with makespan criterion.

关键词： distributed flowshop scheduling blocking iterated greedy algorithm makespan

来源：评论

学校读者我要写书评

暂无评论

Solving robotic distributed flowshop problem using an improved iterated greedy algorithm

引用

INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS 2019年第5期16卷

作者： Li, Wenhan Li, Junqing Gao, Kaizhou Han, Yuyan Niu, Ben Liu, Zhengmin Sun, Qun Shandong Normal Univ Sch Informat Sci & Engn Jinan 250014 Shandong Peoples R China Liaocheng Univ Sch Comp Sci Liaocheng 252059 Shandong Peoples R China Macau Univ Sci & Technol Macau Inst Syst Engn Macau Peoples R China Shandong Univ Finance & Econ Sch Management Sci & Engn Jinan Shandong Peoples R China Liaocheng Univ Sch Mech & Automot Engn Liaocheng Shandong Peoples R China

In this study, we propose an improved iterated greedy algorithm for solving the distributed permutation flowshop problem, where there is a single robot in each factory and the makespan needs to be minimized. In the problem considered, the robot is used to transfer each job from the predecessor machine to the successor machine. A blocking constraint between machines is considered, thus jobs should remain on the completed machine while waiting for the robot. The loading and unloading times are considered and different for all of the jobs conducted by the robot, and the deteriorating time is also considered. In the proposed algorithm, first, four types of neighborhood structures are developed. Then, the simulated annealing algorithm is embedded in the proposed algorithm to enhance the exploration abilities. Furthermore, a problem-specific destruction and construction strategies are investigated. Finally, several realistic instances were generated to test the proposed algorithm, and its competitive performance was verified based on detailed experimental comparisons.

关键词： Distributed flowshop problem deteriorating processing time iterated greedy algorithm robotic transportation

来源：评论

学校读者我要写书评

暂无评论

Effective iterated greedy algorithm for Flow-Shop Scheduling Problems with Time lags

引用

Chinese Journal of Mechanical Engineering 2017年第3期30卷 652-662页

作者： Ning ZHAO Song YE Kaidian LI Siyu CHEN school of mechanical engineering university of science and technology beijingBeijing 100083China

Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem（PFSP with time lags） is concentrated but non-permutation problem（non-PFSP with time lags） seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algo- rithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation（IGTLP） and iterated greedy algorithm for non-permutation （IGTLNP）. The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach. The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% com- putational time compared with traditional GA approach. The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration, which provides an interesting viewpoint for industrial implementation.

关键词： Permutation Non-permutation Flow shopTime lags . Makespan iterated greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2016年第0期98卷 300-307页

作者： Karabulut, Korhan Yasar Univ Software Engn Dept Izmir Turkey

The permutation flowshop scheduling problem is an NP-hard problem that has practical applications in production facilities and in other areas. An iterated greedy algorithm for solving the permutation flow shop scheduling problem with the objective of minimizing total tardiness is presented in this paper. The proposed iterated greedy algorithm uses a new formula for temperature calculation for acceptance criterion and the algorithm is hybridized with a random search algorithm to further enhance the solution quality. The performance of the proposed method is tested on a set of benchmark problems from the literature and is compared to three versions of the traditional iterated greedy algorithm using the same problem instances. Experimental results show that, the proposed algorithm is superior in performance to the other three iterated greedy algorithm variants. Ultimately, new best known solutions are obtained for 343 out of 540 problem instances. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Flowshop problem Scheduling Tardiness iterated greedy algorithm Random search

来源：评论

学校读者我要写书评

暂无评论

New block properties for flowshop scheduling with blocking and their application in an iterated greedy algorithm

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2016年第16期54卷 4759-4772页

作者： Ding, Jian-Ya Song, Shiji Gupta, Jatinder N. D. Wang, Cheng Zhang, Rui Wu, Cheng Tsinghua Univ Dept Automat Beijing Peoples R China Univ Alabama Coll Business Adm Huntsville AL 35899 USA Nanchang Univ Sch Econ & Management Nanchang Peoples R China

This paper proposes new block properties for the flowshop scheduling problem with blocking to minimise makespan. A pruning procedure based on these proposed properties is used in the construction phase of an iterated greedy algorithm to decrease the total number of solutions to be examined to find an optimal schedule. Computational results using Taillard's benchmark problem instances show that the new block properties help to eliminate more unpromising' solutions than the classic properties. In addition, the effectiveness of the proposed algorithm is verified by comparison with some high-performing algorithms for the considered problem.

关键词： scheduling flowshop with blocking block properties pruning procedure iterated greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2015年第4期53卷 1111-1123页

作者： Fernandez-Viagas, Victor Framinan, Jose M. Univ Seville Sch Engn Seville Spain

As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by simultaneously addressing the assignment of jobs to different factories/workshops and their subsequent scheduling. Here we address the so-called distributed permutation flowshop scheduling problem, in which a set of jobs has to be scheduled over a number of identical factories, each one with its machines arranged as a flowshop. Several heuristics have been designed for this problem, although there is no direct comparison among them. In this paper, we propose a new heuristic which exploits the specific structure of the problem. The computational experience carried out on a well-known testbed shows that the proposed heuristic outperforms existing state-of-the-art heuristics, being able to obtain better upper bounds for more than one quarter of the problems in the testbed.

关键词： heuristics scheduling distributed permutation flowshop iterated greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem

引用

APPLIED SOFT COMPUTING 2015年 30卷 604-613页

作者： Ding, Jian-Ya Song, Shiji Gupta, Jatinder N. D. Zhang, Rui Chiong, Raymond Wu, Cheng Tsinghua Univ Dept Automat Beijing 100084 Peoples R China Univ Alabama Coll Business Adm Huntsville AL 35899 USA Nanchang Univ Sch Econ & Management Nanchang 330031 Peoples R China Univ Newcastle Sch Design Commun & Informat Technol Callaghan NSW 2308 Australia

This paper proposes a Tabu-mechanism improved iterated greedy (TMIIG) algorithm to solve the no-wait flowshop scheduling problem with a makespan criterion. The idea of seeking further improvement in the iterated greedy (IG) algorithm framework is based on the observation that the construction phase of the original IG algorithm may not achieve good performance in escaping from local minima when incorporating the insertion neighborhood search. To overcome this limitation, we have modified the IG algorithm by utilizing a Tabu-based reconstruction strategy to enhance its exploration ability. A powerful neighborhood search method that involves insert, swap, and double-insert moves is then applied to obtain better solutions from the reconstructed solution in the previous step. Empirical results on several benchmark problem instances and those generated randomly confirm the advantages of utilizing the new reconstruction scheme. In addition, our results also show that the proposed TMIIG algorithm is relatively more effective in minimizing the makespan than other existing well-performing heuristic algorithms. (C) 2015 Elsevier By. All rights reserved.

关键词： No-wait flow shop iterated greedy algorithm Tabu search Makespan

来源：评论

学校读者我要写书评

暂无评论

A variable iterated greedy algorithm for the traveling salesman problem with time windows

引用

INFORMATION SCIENCES 2014年 279卷 383-395页

作者： Karabulut, Korhan Tasgetiren, M. Fatih Yasar Univ Software Engn Dept Izmir Turkey Yasar Univ Dept Ind Engn Izmir Turkey

This paper presents a variable iterated greedy algorithm for solving the traveling salesman problem with time windows (TSPTW) to identify a tour minimizing the total travel cost or the makespan, separately. The TSPTW has several practical applications in both production scheduling and logistic operations. The proposed algorithm basically relies on a greedy algorithm generating an increasing number of neighboring solutions through the use of the idea of neighborhood change in variable neighborhood search (VNS) algorithms. In other words, neighboring solutions are generated by destructing a solution component and re-constructing the solution again with variable destruction sizes. In addition, the proposed algorithm is hybridized with a VNS algorithm employing backward and forward 1_Opt local searches to further enhance the solution quality. The performance of the proposed algorithm was tested on several benchmark suites from the literature. Experimental results confirm that the proposed algorithm is either competitive to or even better than the best performing algorithms from the literature. Ultimately, new best-known solutions are obtained for 38 out of 125 problem instances of the recently proposed benchmark suite, whereas 15 out of 31 problem instances are also further improved for the makespan criterion. (C) 2014 Elsevier Inc. All rights reserved.

关键词： Traveling salesman problem with time windows iterated greedy algorithm Variable neighborhood search Heuristic optimization

来源：评论

学校读者我要写书评

暂无评论

An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

引用

INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE 2014年第3期45卷 351-362页

作者： Deng, Guanlong Gu, Xingsheng E China Univ Sci & Technol Key Lab Adv Control & Optimizat Chem Proc Minist Educ Shanghai 200237 Peoples R China

This article presents an enhanced iterated greedy (EIG) algorithm that searches both insert and swap neighbourhoods for the single-machine total weighted tardiness problem with sequence-dependent setup times. Novel elimination rules and speed-ups are proposed for the swap move to make the employment of swap neighbourhood worthwhile due to its reduced computational expense. Moreover, a perturbation operator is newly designed as a substitute for the existing destruction and construction procedures to prevent the search from being attracted to local optima. To validate the proposed algorithm, computational experiments are conducted on a benchmark set from the literature. The results show that the EIG outperforms the existing state-of-the-art algorithms for the considered problem.

关键词： scheduling heuristics single machine tardiness iterated greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：