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

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

作者： Chenyao Zhang Yuting Wang Yuhang Wang Yong Wang Chengshuai Li Feng Yang School of Computer Science Liaocheng University

The limitations of the centralized production model and the advancement of mass customization production models are guiding the manufacturing industry toward a distributed production *** article aims to solve the distributed blocking flow shop scheduling problem with sequence-dependent setup times,called DBFSP ***,a Two-stage perturbation iterated greedy algorithm(TIG) is developed to optimize maximum completion *** TIG,a mechanism with self-adaptive thinking is developed in global perturbation process and an efficient insertion operator is presented in local perturbation *** counting extensive experimental results,the proposed TIG outperforms the existing state-of-the-art algorithms in solving the considered problem.

关键词： blocking distributed flowshop iterated greedy algorithm makespan

来源：评论

学校读者我要写书评

暂无评论

Minimizing Total Tardiness in the Distributed Flowshop Group Scheduling Problem with an iterated greedy algorithm

Minimizing Total Tardiness in the Distributed Flowshop Group...

引用

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

作者： Zhi-Yuan Wang Yiran Pan Quan-Ke Pan School of Mechanical and Electrical Engineering and Automation Shanghai University School of Information Management Shanghai Lixin University of Accounting and Finance School of Computer Science Liaocheng University

This paper studies a distributed permutation flowshop group scheduling problem(DPFGSP) with a total tardiness criterion,which has significant applications in the current manufacturing *** considered problem can be broken down into three sub-problems:how to assign the families to each factory,how to determine the sequence of the families within each factory,and the processing order of jobs within each *** paper proposes an effective two-stage iterated greedy algorithm(FJIG) to minimize the total tardiness time for the DPFGSP and utilizes an improved NEH heuristic to generate an initial solution for the proposed *** statistical experiments are carried out to test the effectiveness of the FJIG and the experimental results demonstrate that the proposed FJIG is very effective for the DPFGSP with total tardiness criterion.

关键词： Distributed group scheduling tardiness time metaheuristic iterated greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop

引用

APPLIED SOFT COMPUTING 2021年 99卷

作者： Zou, Wen-Qiang Pan, Quan-Ke Tasgetiren, M. Fatih Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200072 Peoples R China Liaocheng Univ Sch Comp Sci Liaocheng 252000 Shandong Peoples R China Yasar Univ Int Iogist Management Dept Izmir Turkey

In this paper, we address a multi-compartment automatic guided vehicle scheduling (MC-AGVS) problem from a matrix manufacturing workshop that has attracted more and more attention of manufacturing firms in recent years. The problem aims to determine a solution to minimize the total cost including the travel cost, the service cost, and the cost of vehicles involved. For this purpose, a mixed-integer linear programming model is first constructed. Then, a novel iterated greedy (IG) algorithm including accelerations for evaluating objective functions of neighboring solutions;an improved nearest-neighbor-based constructive heuristic;an improved sweep-based constructive heuristic;an improved destruction procedure;and a simulated annealing type of acceptance criterion is proposed. At last, a series of comparative experiments are implemented based on some real-world instances from an electronic equipment manufacturing enterprise. The computational results demonstrate that the proposed IG algorithm has generated substantially better solutions than the existing algorithms in solving the problem under consideration. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Automated guided vehicle Multi-compartment Scheduling iterated greedy algorithm Heuristics

来源：评论

学校读者我要写书评

暂无评论

An effective multi-restart iterated greedy algorithm for multi-AGVs dispatching problem in the matrix manufacturing workshop

引用

EXPERT SYSTEMS WITH APPLICATIONS 2024年 252卷

作者： Liu, Zi-Jiang Sang, Hong-Yan Zheng, Chang-Zhe Chi, Hao Gao, Kai-Zhou Han, Yu-Yan Liaocheng Univ Sch Comp Liaocheng 252059 Peoples R China

An excellent automated guided vehicle (AGV) scheduling scheme can effectively improve the productivity of automated manufacturing factories and reduce costs, so the AGV dispatching problem (AGVDP) has become a research hotspot. This paper studies AGVDP with AGV capacity and the latest delivery time to reduce the cost of the total objective consisting of AGV cost, travel cost, and penalty cost. To this end, a mixed-integer linear programming model and a multi-restart iterated greedy (MRIG) algorithm are proposed. According to the characteristics of the problem, an improved nearest neighbor-based heuristic algorithm (INNH) is proposed to generate an initial solution. INNH includes a balanced two-factor selection strategy and a multiple-try insertion strategy. In the MRIG, the destruction stage has been improved to have an adaptive parameter. To enhance the quality of the initial solution and the depth of the evolution, two improved reference local searches are proposed. Furthermore, a multi-restart strategy with a checking mechanism and five restart methods is designed to avoid MRIG falling into the local optimum. The results of sufficient statistical experiments show that the MRIG is obviously superior to the existing algorithms when solving AGVDP.

关键词： Automated guided vehicle Dispatching iterated greedy algorithm Matrix manufacturing workshop

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An upgraded iterated greedy scheduling algorithm for distributed blocking flowshop group problem 35

An upgraded iterated greedy scheduling algorithm for distrib...

引用

35th Chinese Control and Decision Conference (CCDC)

作者： Ji, Qianhui Han, Yuyan Wang, Yuhang Wang, Yizheng Liaocheng Univ Sch Comp Sci Liaocheng Shandong Peoples R China

ISBN: (纸本)9798350334722

Owing to the needs of production technology, the demand for group scheduling models will further increase to save costs and time. Thus, the flowshop group scheduling problem (FGSP) has attracted a lot of attention, and is of theoretical significance for academic discussion and practical application. in 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 capabilities. Through 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 upgraded iterated greedy scheduling algorithm for distributed blocking flowshop group problem

An upgraded iterated greedy scheduling algorithm for distrib...

引用

第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

来源：评论

学校读者我要写书评

暂无评论

iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion

引用

COMPUTERS & OPERATIONS RESEARCH 2017年 77卷 111-126页

作者： Tasgetiren, M. Fatih Kizilay, Damla Pan, Quan-Ke Suganthan, P. N. Yasar Univ Dept Ind Engn Izmir Turkey Huazhong Univ Sci & Technol Wuhan Peoples R China Nanyang Technol Univ Sch Elect Singapore Singapore

Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling problem (BFSP) with the makespan criterion. Main contributions of this paper can be summed up as follows. We propose a constructive heuristic to generate an initial solution. The constructive heuristic generates better results than those currently in the literature. We employ and adopt well-known speed-up methods from the literature for both insertion and swap neighborhood structures. In addition, an iteration jumping probability is proposed to change the neighborhood structure from insertion neighborhood to swap neighborhood. Generally speaking, the insertion neighborhood is much more effective than the swap neighborhood for the permutation flowshop scheduling problems. Instead of considering the use of these neighborhood structures in a framework of the variable neighborhood search algorithm, two powerful local search algorithms are designed in such a way that the search process is guided by an iteration jumping probability determining which neighborhood structure will be employed. By doing so, it is shown that some additional enhancements can be achieved by employing the swap neighborhood structure with a speed-up method without jeopardizing the effectiveness of the insertion neighborhood. We also show that the performance of the iterated greedy algorithm significantly depends on the speed-up method employed. The parameters of the proposed iterated greedy algorithms are tuned through a design of experiments on randomly generated benchmark instances. Extensive computational results on Taillard's well-known benchmark suite show that the iterated greedy algorithms with speed-up methods are equivalent or superior to the best performing algorithms from the literature. Ultimately, 85 out of 120 problem instances are further improved with substantial marg

关键词： Meta-heuristics Blocking flowshop iterated greedy algorithm Variable neighborhood search Constructive heuristics

来源：评论

学校读者我要写书评

暂无评论

iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization 18

Iterated greedy algorithms for the hybrid flowshop schedulin...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Oztop, Hande Tasgetiren, M. Fatih Eliiyi, Deniz Tursel Pan, Quan-Ke Yasar Univ Dept Ind Engn Izmir Turkey Yasar Univ Dept Int Logist Management Izmir Turkey Huazhong Univ Sci & Technol State Key Lab Wuhan Peoples R China

ISBN: (纸本)9781450356183

The hybrid flosshop scheduling problem (HFSP) has been extensively studied in the literature, due to its complexity and reallife applicability. Various exact and heuristic algorithms have been developed for the HFSP, and most consider makespan as the only criterion. The studies on HFSP sith the objective of minimizing total flos time have been rather limited. This paper presents a mathematical model and efficient iterated greedy algorithms, IG and IGALL, for the HFSP sith total flos time criterion. In order to evaluate the performance of the proposed IG algorithms, the sellknosn HFSP benchmark suite from the literature is used. As the problem is NP-hard, the proposed mathematical model is solved for all 87 instances under a time limit on CPLEX. Optimal results are obtained for some of these instances. The performance of the IG algorithms is measured by comparisons sith these time-limited CPLEX results of the mathematical model. Computational results shos that the proposed IG algorithms perform very sell in terms of solution time and quality. To the best of our knosledge, for the first time in the literature, the results of flos time criterion have been reported for the HFSP benchmark suite.

关键词： Hybrid flosshop scheduling iterated greedy algorithm total flos time

来源：评论

学校读者我要写书评

暂无评论

Developing algorithm and dispatching rules for scheduling a realistic flexible flow shop with setups to minimize total weighted tardiness

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2025年第1期138卷 225-245页

作者： Hsieh, Feng Yu Lin, Yang Kuei Wang, Yi-Chi Feng Chia Univ Dept Ind Engn & Syst Management Taichung 407 Taiwan

In this research, we are studying the scheduling problem of a professional ball manufacturing company in Taiwan. The problem is related to scheduling a flexible flow shop that includes setups with the aim of minimizing total weighted tardiness. We first present a mathematical model for the studied problem. Next, we conduct data processing and generate initial solutions. This involves extracting ordering data from the company, aggregating the total demand based on the product types of all orders, and splitting the demand into sublots. For production purposes, each subplot will be matched with a production lot, abbreviated as PLot. We assign a score to each order based on customer priority, order amount, due date, and order profitability. This has allowed us to propose a strategy in which orders compete for production priority based on their scores. We also proposed four dispatching rules to assign PLots to machines based on their production priority. Finally, we have suggested an iterated greedy algorithm with mutation (IGm algorithm) to improve the initial solutions obtained through dispatching rules. Extensive computational runs based on real data have been conducted to compare the performances of the proposed orders competing for production priority, the four dispatching rules, and the IGm algorithm with sequences generated by the EDD (Earliest Due Date) and WEDD (Weighted Earliest Due Date) rules. Computational results demonstrate that the proposed orders competing for production priority, along with the dispatching rules and the IGm algorithm, are effective in providing promising results for the scheduling problem.

关键词： Scheduling Flexible flow shop Steel ball Dispatching rules iterated greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：