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

2024 Genetic and Evolutionary Computation Conference Companion, GECCO 2024 Companion

作者： Jia, Weiyan Tang, Lixin Yang, Yang Dong, Yun National Frontiers Science Center for Industrial Intelligence and Systems Optimization Key Laboratory of Data Analytics and Optimization for Smart Industry Northeastern University Ministry of Education Shenyang China National Frontiers Science Center for Industrial Intelligence and Systems Optimization Northeastern University Shenyang China Liaoning Engineering Laboratory of Data Analytics and Optimization for Smart Industry Shenyang China Liaoning Key Laboratory of Manufacturing System and Logistics Optimization Shenyang China

ISBN: (纸本)9798400704956

Planning in the cold rolling is an increasingly important vital aspect in steel industry. In this study, we investigate a cold rolling planning problem derived from a steel company, which is characterized by multi-item considerations with sequence-dependent setups in a single period. To tackle this problem, we introduce a bi-objective modified lot-sizing model, aiming at minimizing both the capacity waste and setup cost. A dedicated multi-objective evolutionary algorithm is proposed to solve this problem. The experiment results demonstrate the effectiveness of the proposed algorithm in achieving near-optimal solutions within a reasonable time, which can facilitate reductions in both production costs and time. © 2024 Copyright held by the owner/author(s).

关键词： evolutionary algorithm

来源：评论

学校读者我要写书评

暂无评论

A new enhanced-dynasearch & TS for the pickling-rolling scheduling problem

引用

Zidonghua Xuebao/ Acta Automatica Sinica 2010年第2期36卷 304-313页

作者： Tang, Li-Xin Zhao, Ren Liaoning Key Laboratory of Manufacturing System and Logistics The Logistics Institute Northeastern University Shenyang 110004 China

Motivated by pickling-rolling production in steel industry, the pickling-rolling scheduling problem is to create a schedule by selecting and sequencing many proper coils from the candidate pool with consideration of the changeovers cost between adjacent coils. Besides the capacity constraints and practical production technical constraints, the flow requirement constraint is also considered so that the total weight of the selected coils belonging to the same downstream unit satisfies the production requirement of the corresponding downstream unit, the objective being to minimize the total transition cost and the penalty cost on the left capacity. The problem is formulated as an integer programming model and a new tabu search (TS) with the enhanced dynasearch algorithm is developed for it. A two-phase heuristic based on nearest insert method is proposed to act as the initial feasible solution to the tabu search. The proposed algorithm designs a double tabu list to fit the different neighborhood structure. For the solution to escape from the local optima, the enhanced dynasearch neighborhood is embedded in each iteration. The dynasearch neighborhood is polynomially searchable by dynamic programming and it can perform a multiple-exchange composite move by combining swap and inner-insert neighborhoods. Based on the analysis of the characteristics of the problem, block structure is defined and several properties of the feasible solution are derived to accelerate the search process. Computational results show that the enhanced-dynsearch & TS algorithm is effective for solving the problem and outperforms the standard one by 3.62 % on average. Copyright © 2010 Acta Automatica Sinica. All rights reserved.

关键词： Tabu search

来源：评论

学校读者我要写书评

暂无评论

Two-machine Shop Scheduling with Two Agents and Linear Deteriorating Jobs

Two-machine Shop Scheduling with Two Agents and Linear Deter...

引用

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

作者： Xiaoli Zhao Gongshu Wang Institute of Industrial Engineering and Logistics Optimization Liaoning Key Laboratory of Manufacturing System and LogisticsNortheastern University

ISBN: (纸本)9781479970186

We consider a two-machine shop scheduling problem in which the jobs are from two agents and each job has a time-dependent proportional deteriorating processing *** two agents compete for a common two-machine shop setting to process their own *** agent has its own criterion to *** shop settings are investigated:flow-shop,open-shop and *** each setting,the goal is to find a schedule to process the jobs such that the makespan of one agent is minimized while the makespan of the other agent is no more than a given upper *** prove that all the problems are ***,we present efficient algorithms for two special cases of flow-shop scheduling problem.

关键词： Scheduling,Two-agent,Deterioration,Shop setting

来源：评论

学校读者我要写书评

暂无评论

Cooperation in a single-machine scheduling problem with job deterioration

Cooperation in a single-machine scheduling problem with job ...

引用

2016 IEEE Information Technology,Networking,Electronic and Automation Control Conference(ITNEC 2016)

作者： Feng Li Yang Yang Liaoning Key Laboratory of Manufacturing System and Logistics Institute of Industrial Engineering & Logistics OptimizationNortheastern University

ISBN: (纸本)9781467391955

In this paper we consider a single-machine scheduling problem with job deterioration, which is solved by a game theory approach. The problem considered is to find the maximal cost savings of the grand coalition and divide the maximal cost savings. In this paper, we prove that the cooperative game is convex and an allocation rule to divide the maximal cost savings is proposed.

关键词： scheduling cooperative game job deterioration

来源：评论

学校读者我要写书评

暂无评论

Energy consumption prediction in ironmaking process using hybrid algorithm of SVM and PSO 1

引用

9th International Symposium on Neural Networks, ISNN 2012

作者： Zhang, Yanyan Zhang, Xiaolei Tang, Lixin Liaoning Key Laboratory of Manufacturing System and Logistics Northeastern University Shenyang China State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang China Logistics Institute Northeastern University Shenyang China

ISBN: (数字)9783642313622

ISBN: (纸本)9783642313615

In this paper, a support vector machine (SVM) classifier is designed for predicting the energy consumption level of Ironmaking process. To improve the accuracy, particle swarm optimization (PSO) is introduced to optimize the parameters of SVM. First, the consuming structure of Ironmaking process is analyzed so as to accurately modeling the prediction problem. Then the improved SVM algorithm is presented. Finally, the experimental test is implemented based on the practical data of a Chinese Iron and Steel enterprise. The results show that the proposed method can predict the consumption of the addressed Ironmaking process with satisfying accuracy. And that the results can provide the enterprise with effective quantitative analysis support. © 2012 Springer-Verlag.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

MMPP/M/C queue with congestion-based staffing policy and applications in operations of steel industry

引用

Journal of Iron and Steel Research International 2019年第7期26卷 659-668页

作者： Yan-he Jia Li-xin Tang Zhe George Zhang Xiao-feng Chen Liaoning Key Laboratory of Manufacturing System and Logistics Institute of Industrial and Systems Engineering Northeastern University Shenyang 110819 Liaoning China Beedie School of Business Simon Fraser University Burnaby BC V5A 1S6 Canada Department of Decision Sciences Western Washington University Bellingham WA 98225 USA

A queueing model of the Markov-modulated Poisson process (MMPP) with thresholds was investigated. The customer arrival with various arrival rates in the model was viewed as the MMPP. In contrast to the Poisson, s arrival process, the MMPP can better describe the situation that the arrival rate changes with changing conditions;therefore, the model fits better with reality. The threshold conversion was added to the model based on the general MMPP/M/C model. When the number of customers in the system exceeds a threshold, all servers work to serve;when the number of customers in the system is less than another threshold, some servers are shut down. This is the congestion-based staffing policy with two thresholds. Specifically, the problems in the slab stocking stage of slab production at the Iron and Steel Complex in China were analysed. In the slab production process, because the rate of the upstream steelmaking is not constant, the rate of slab reaching the slab yard is uncertain. The crane service is used to store slabs in a warehouse. Because the slab arrival rate varies, different numbers of cranes in service need to be optimized for cost control. Thus, MMPP was used to describe slab arrival with varied arrival rates. Therefore, an MMPP/M/C queue with thresholds was used to analyse and solve the practical problems, and the optimal number of service cranes was obtained to minimize the cost of slab stocking.

关键词： Markov-modulated Poisson process Matrix geometry Congestion-based staffing policy Threshold conversion Slab Crane

来源：评论

学校读者我要写书评

暂无评论

Worker PC performance measurements using benchmarks for user-PC computing system

Worker PC performance measurements using benchmarks for user...

引用

IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW)

作者： Nobuo Funabiki Yuki Aoyagi Minora Kuribayashi Wen-Chun Kao Liaoning Key Laboratory of Manufacturing System and Logistics Institute of Industrial Engineering & Logistics Optimization Northeastern University Shenyang China

ISBN: (纸本)9781509020744

The User-PC computing system (UPC) has been studied to provide a parallel computing platform for members in a group using idling computing resources in personal computers (PCs) of them. UPC adopts the master-worker model where we have implemented the programs for the master on Linux and for the worker on Linux and Windows. However, the current job scheduling method does not consider the real performance of a worker PC. In this paper, we implement a function to measure the performance of a worker PC using two benchmark programs. The experiment results for six PCs in our group show that there are three times difference in the CPU performance and eight times difference in the disk performance.

关键词： Handheld computers Conferences Decision support systems XML Heart beat

来源：评论

学校读者我要写书评

暂无评论

A scheduling problem on a single batching machine with batch deliveries

A scheduling problem on a single batching machine with batch...

引用

作者： Gong, Hua Tang, Lixin College of Science Shenyang Ligong University Shenyang 100159 China Liaoning Key Laboratory of Manufacturing System and Logistics Logistics Institute Northeastern University Shenyang 110004 China

ISBN: (纸本)9789881725592

In this paper, we address a coordination problem of single batching machine scheduling and finished jobs delivery where the jobs are processed on a single batching machine and delivered by a transporter to the customer. The batching machine can handle several jobs simultaneously. The processing time of a batch is equal to the longest processing time among the jobs in a batch. For the objective to minimize the makespan, we present a polynomial-time algorithm based on optimal properties. For the objective to minimize the total weighted completion time, we prove that this problem is strongly NP-hard. © 2011 Chinese Assoc of Automati.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

A hybrid tabu search for steelmaking-continuous casting production scheduling problem

A hybrid tabu search for steelmaking-continuous casting prod...

引用

作者： Zhao, Y. Jia, F.Y. Wang, G.S. Wang, L.J. Liaoning Key Laboratory of Manufacturing System and Logistics Logistics Institute Northeastern University Shenyang 110819 China School of Material and Metallurgy Northeastern University Shenyang 110819 China

In this paper, we study the steelmaking-continuous casting (SCC) production scheduling problem. Considering the constraints of the practical technological requirements and the objective of minimizing the total waiting time of jobs, we formulate a mathematical programming model. Due to the complexity of the model, we solve it by a decomposition strategy, i.e. jobs are allocated and sequenced on machines first, and the time table of all jobs is then established. We propose a tabu search algorithm to deal with the allocation and sequencing decisions and use a linear programming model to establish the time table of jobs. For tabu search algorithm, we design three different neighborhood structures, including the insertion neighborhood, the restricted neighborhood whose size is changeable, and a kick strategy based on swap move. We test the proposed algorithm on a set of real problems, and the computational results demonstrate the effectiveness of the proposed algorithm. © 2011 Zhejiang University.

关键词： Continuous casting

来源：评论

学校读者我要写书评

暂无评论

An improved quantum-behaved PSO algorithm for a new process optimization problem based on mechanism model of LBE converter

An improved quantum-behaved PSO algorithm for a new process ...

引用

作者： Zhang, Jun Jia, Feng-Yong Tang, Li-Xin Liaoning Key Laboratory of Manufacturing System and Logistics Logistics Institute Northeastern University Shenyang 110819 China School of Materials and Metallurgy Northeastern University Shenyang 110819 China

A process optimization method based on LBE converter mechanism model is studied in this paper. According to the characteristic of converter steelmaking, the composition of molten steel plays an important role on quality of steelmaking production. The optimal setting of input raw materials is extremely complex, and the classical low efficiency heuristic model is usually adopted in actual applications. A process optimization model based on mechanism method of LBE converter is proposed in this paper by making the raw material cost and hitting rate of endpoint as objective at the same time, using the energy, mass conservation equations and physical-chemical balances of the steel-making process as constraints, which is also very crucial in the actual production. Those are different from other common research literatures. Evenly, the objective is highly non-linear, lots of constraints are satisfied at the same time, and there is also some complicated physicochemical reaction in the hot bath. It is significant and challenging to solve this sort of complex, multivariate and highly non-linear problem. An evolution quantum-inspired particle swarm optimization algorithm (EQPSO) is proposed to solve the process model in this paper. Instead of position and velocity in the original PSO algorithm, every individual particle is depicted by a wave function ψ (x,t) and DE evolutionary strategy in EQPSO, which make the particles have quantum behavior. Meanwhile, the global and local convergence ability are improved simultaneously by the operation of differential evolution by introducing mbest, raising the convergence accuracy of EQPSO. The experimental results show the effectiveness of the model with the EQPSO. © 2011 Zhejiang University.

关键词： Steelmaking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：