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

Underground production scheduling with ventilation and refrigeration considerations

OPTIMIZATION AND ENGINEERING 2022年第3期23卷 1677-1705页

作者： Ogunmodede, Oluwaseun Lamas, Patricio Brickey, Andrea Bogin, Gregory, Jr. Newman, Alexandra Colorado Sch Mines Golden CO 80401 USA Univ Adolfo Ibanez Santiago Chile South Dakota Sch Mines Rapid City SD USA

Underground mine production scheduling determines when, if ever, activities associated with the extraction of ore should be executed. The accumulation of heat in the mine where operators are working is a major concern. At the time of this writing, production scheduling and ventilation decisions are not made in concert. Correspondingly, heat limitations are largely ignored. Our mixed-integer program maximizes net present value subject to constraints on precedence, and mill and extraction capacities with the consideration of heat using thermodynamic principles, while affording the option of activating refrigeration to mitigate heat accumulation. In seconds to hours, depending on the problem size (up to thousands of activities and 900 daily time periods), a corresponding methodology that exploits the mathematical problem structure provides schedules that maintain a safe working environment for mine operators;optimality gaps are no more than 15% and average less than half that for otherwise-intractable instances.

关键词： Underground mine scheduling Integer programming applications resource-constrained project scheduling Ventilation Diesel equipment Refrigeration

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithms for planning and scheduling engineer-to-order production: a systematic review

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2024年第8期62卷 2888-2917页

作者： Neumann, Anas Hajji, Adnene Rekik, Monia Pellerin, Robert CIRRELT Interuniv Res Ctr Enterprise Networks Logi Quebec City PQ Canada Laval Univ Fac Business Adm Dept Operat & Decis Syst Quebec City PQ Canada Polytech Montreal Dept Math & Ind Engn Quebec City PQ Canada Off PAP2507 2325 Terrasse St Quebec City PQ G1V 0A6 Canada

This paper provides a systematic review of the Genetic Algorithm (GA)s proposed to solve planning and scheduling problems in Engineer-To-Order (ETO) contexts. Our review focuses on how the key characteristics of ETO projects affect both the problem studied and the GA algorithmic features. Typical ETO projects consist of one-of-a-kind products with complex structures and uncertain designs. A deep analysis of the papers published between 2000 and 2022 enables identifying 10 main characteristics of ETO projects, six activity types, 10 decision types, eight groups of constraints, and 10 optimisation objectives. Our study shows that none of the reported papers integrates all 10 ETO characteristics. The less studied ETO characteristics are incorporating design and engineering information in the problem definition and the design uncertainty. Our review also identifies 10 recurrent encoding formats and emphasises the most frequently used genetic operators. We observed that most planning and scheduling problems consider objectives and decisions related to product customisation or supply chain configuration yielding multi-objective problems. Most multi-objective GAs use a weighted sum or are based on NSGAII. Diversity maintenance methods, adaptive and parameter tunning mechanisms, or hybridisation with machine learning models are still not used in this context.

关键词： Engineer-To-Order genetic algorithm resource-constrained project scheduling product customisation evolutionary algorithm one-of-a-kind product

来源：评论

学校读者我要写书评

暂无评论

Sports league scheduling: Graph- and resource-based models

引用

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2007年第5期35卷 465-471页

作者： Drexl, Andreas Knust, Sigrid Univ Kiel Inst Betriebswirtschaftslehre D-24118 Kiel Germany Univ Osnabruck Inst Informat D-49069 Osnabruck Germany

Generating a sports league schedule is a challenging task due to the variety of different requirements which have to be addressed. This has led to a multitude of alternative approaches. Most of them rely on graph-theoretical concepts and the solution of the overall problem is based on the decomposition of the problem into certain subproblems. In this paper, we give a comprehensive survey of these more traditional approaches. Furthermore, we present a new resource-based model which shall serve as a starting point for the development of new solution algorithms. (c) 2005 Elsevier Ltd. All rights reserved.

关键词： scheduling sports leagues timetabling resource-constrained project scheduling

来源：评论

学校读者我要写书评

暂无评论

An Integrated Optimization Model for Life Cycle Pavement Maintenance Budgeting Problems

引用

IEEE ACCESS 2022年 10卷 13884-13900页

作者： Liu, Shu-Shun Arifin, Muhammad Faizal Ardhiansyah Chen, Wei Tong Natl Yunlin Univ Sci & Technol Dept Civil & Construct Engn Touliu 64002 Yunlin Taiwan Univ Negeri Semarang Dept Civil Engn Semarang 50229 Indonesia

Driven by the demand to preserve the existing road pavement condition, the issue of selecting maintenance action at the appropriate time under budget limitation has attracted great attention from highway agencies. This study focuses on the strategy of how to manage pavement maintenance budget effectively on road network level based on life cycle cost analysis. The framework of resource-constrained project scheduling problem (RCPSP) is implemented to establish a maintenance action decision-making mechanism for allocating pavement maintenance budgets on the planning and controlling phases. In the RCPSP environment, a two-stage optimization model based on constraint programming techniques is developed to meet two different management goals such as 1. annual budget evaluation from planning points of view, and 2. actual budget adjustment from the controlling point of view, by considering the factor of road usability. Model-I, the life cycle lifespan evaluation model solves the problem of annual budget evaluation to satisfy the maintenance requirements of all road sections. The optimal maintenance plan then can be made to maintain road performance and evaluate annual budget requirement for future years to maximize total maintenance benefits, in terms of the overall maximum pavement lifespan. Based on the suggested results of budget evaluation from Model-I, Model-II, the actual budget adjustment model deals with the actual budget allocation problem of how to keep up the original maintenance budget plan when the actual budget is always awarded insufficiently each year. Finally, the proposed two-stage integrated models provide an optimal maintenance strategy to respond to actual maintenance status and pavement deterioration as feedbacks to the actual budget adjustment model, and recursively make pavement maintenance strategy closer to actual conditions by budget adjustment yearly.

关键词： Maintenance engineering Roads Costs Optimization Planning resource management Indexes Pavement maintenance life cycle cost budget allocation resource-constrained project scheduling constraint programming

来源：评论

学校读者我要写书评

暂无评论

A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints

引用

JOURNAL OF scheduling 2023年第1期26卷 95-111页

作者： Watermeyer, Kai Zimmermann, Juergen Tech Univ Clausthal Inst Management & Econ Operat Res Grp Julius Albert Str 2 D-38678 Clausthal Zellerfeld Germany

This paper deals with the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints with the objective to minimize the project duration. The consideration of partially renewable resources allows to integrate the decision about the availability of a resource for a specific time period into the scheduling process. Together with general temporal constraints, which permit to establish minimum and maximum time lags between activities, even more aspects of real-life projects can be taken into account. We present a branch-and-bound algorithm for the stated problem that is based on a serial schedule-generation scheme. For the first time it is shown how a dominance criterion can be applied on the associated generation scheme to reduce the start times in each scheduling step. To improve the performance of the solution procedure, we integrate consistency tests and lower bounds from the literature and devise new pruning techniques. In a comprehensive experimental performance analysis we compare our exact solution procedure with all available branch-and-bound algorithms for partially renewable resources. Additionally, we investigate a directly derived priority rule-based approximation method from our new enumeration scheme. The results of the computational study demonstrate the efficiency of our branch-and-bound algorithm and reveal that the derived approximation method is only suited to solve small- and medium-sized instances.

关键词： project scheduling Branch and bound resource-constrained project scheduling Partially renewable resources Minimum and maximum time lags

来源：评论

学校读者我要写书评

暂无评论

Discrete-time mixed-integer programming models and solution methods for production scheduling in multistage facilities

引用

COMPUTERS & CHEMICAL ENGINEERING 2016年 94卷 387-410页

作者： Merchan, Andres F. Lee, Hojae Maravelias, Christos T. Univ Wisconsin Dept Chem & Biol Engn 1415 Engn Dr Madison WI 53706 USA

We address the problem of production scheduling in multi-product multi-stage batch plants. Unlike most of the previous works, which propose continuous-time models, we study discrete-time mixed-integer programming models and solution methods. Specifically, we discuss two models based on network representations of the facility and develop two new models inspired by the resource-constrained project scheduling Problem. Furthermore, we propose different solution methods, including tightening methods based on processing unit availability, a reformulation based on processing unit occupancy, and an algorithm to refine approximate solutions for large-scale instances. Finally, we present a comprehensive computational study which shows that speedups of up to four orders of magnitude in are observed when our models and methods are compared to existing approaches. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Sequential production environments resource-constrained project scheduling Tightening constraints Reformulations

来源：评论

学校读者我要写书评

暂无评论

Real-world production scheduling for the food industry: An integrated approach

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2012年第2期25卷 222-228页

作者： Wauters, Tony Verbeeck, Katja Verstraete, Paul Vanden Berghe, Greet De Causmaecker, Patrick KaHo Sint Lieven CODeS Vakgrp IT B-9000 Ghent Belgium MESware Nv B-8800 Roeselare Belgium CODeS B-8500 Kortrijk Belgium

The present paper offers an integrated approach to real-world production scheduling for the food processing industries. A manufacturing execution system is very appropriate to monitor and control the activities on the shop floor. Therefore, a specialized scheduler, which is the focus of this paper, has been developed to run at the core of such a system. The scheduler builds on the very general resource constrained project scheduling Problem with Generalized Precedence Relations. Each local decision step (e.g. choosing a route in the plant layout) is modeled as a separate module interconnected in a feedback loop. The quality of the generated schedules will guide the overall search process to continuously improve the decisions at an intermediate level by using local search strategies. Besides optimization methods, data mining techniques are applied to historical data in order to feed the scheduling process with realistic background knowledge on key performance indicators, such as processing times, setup times, breakdowns, etc. The approach leads to substantial speed and quality improvements of the scheduling process compared to the manual practice common in production companies. Moreover, our modular approach allows for further extending or improving modules separately, without interfering with other modules. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Real-world scheduling Food industry Local search resource-constrained project scheduling Generalized precedence relations Plant routing

来源：评论

学校读者我要写书评

暂无评论

Integration of electromagnetism with multi-objective evolutionary algorithms for RCPSP

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2016年第1期251卷 22-35页

作者： Xiao, Jing Wu, Zhou Hong, Xi-Xi Tang, Jian-Chao Tang, Yong S China Normal Univ Sch Comp Sci Guangzhou 510631 Guangdong Peoples R China

As one of the most challenging combinatorial optimization problems in scheduling, the resource-constrained project scheduling problem (RCPSP) has attracted numerous scholars' interest resulting in considerable research in the past few decades. However, most of these papers focused on the single objective RCPSP;only a few papers concentrated on the multi-objective resource-constrained project scheduling problems (MORCPSP). Inspired by a procedure called electromagnetism (EM), which can help a generic population based evolutionary search algorithm to obtain good results for single objective RCPSP, in this paper we attempt to extend EM and integrate it into three reputable state-of-the-art multi-objective evolutionary algorithms (MOEAs) i.e. non-dominated sorting based multi-objective evolutionary algorithm (NSGA-II), strength Pareto evolutionary algorithm (SPEA2) and multi-objective evolutionary algorithm based on decomposition (MOEA/D), for MORCPSP. We aim to optimize makespan and total tardiness. Empirical analysis based on standard benchmark datasets are conducted by comparing the versions of integrating EM to NSGA-II, SPEA2 and MOEND with the original algorithms without EM. The results demonstrate that EM can improve the performance of NSGA-II and SPEA2, especially for NSGA-II. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Multiple objective programming Heuristics resource-constrained project scheduling Electromagnetism Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

On maximizing the net present value of a project under renewable resource constraints

引用

MANAGEMENT SCIENCE 2001年第8期47卷 1113-1121页

作者： Vanhoucke, M Demeulemeester, E Herroelen, W Katholieke Univ Leuven Dept Appl Econ Operat Management Grp B-3000 Louvain Belgium

In this paper we study the resource-constrained project-scheduling problem with discounted cash flows. Each activity of this resource-constrained project-scheduling problem has certain resource requirements and a known deterministic cash flow that can be either positive or negative. Deterministic cash flows are assumed to occur over the duration of the activities. Progress payments and cash outflows occur at the completion of activities. The objective is to schedule the activities subject to a fixed deadline to maximize the net present value subject to the precedence and resource constraints. With these features the financial aspects of project management are taken into account. We introduce a depth-first branch-and-bound algorithm that makes use of extra precedence relations to resolve a number of resource conflicts and a fast recursive search algorithm for the max-npv problem to compute upper bounds. The recursive search algorithm exploits the idea that positive cash flows should be scheduled as early as possible while negative cash flows should be scheduled as late as possible within the precedence constraints. The procedure has been coded in Visual C++, Version 4.0 under Windows NT, and has been validated on two problem sets.

关键词： resource-constrained project scheduling discounted cash flows branch-and-bound

来源：评论

学校读者我要写书评

暂无评论

Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production

引用

OR SPEKTRUM 1997年第3期19卷 205-217页

作者： Neumann, K Schwindt, C UNIV KARLSRUHE INST WIRTSCHAFTSTHEORIE & OPERAT RESD-76128 KARLSRUHEGERMANY

Maximal time lags between activities of a project play an important role in practice in addition to minimal ones. However, maximal time lags have been discussed very rarely in literature thus far. This paper shows how to model projects with minimal and maximal time lags by cyclic activity-on-node networks. As an important application, the production process for make-to-order production with limited resources is studied, which can be represented by a multi-project network where the individual operations of the jobs correspond to the nodes of the network. For different product structures, careful consideration is given to the modelling of a nondelay performance of overlapping operations by appropriately establishing minimal and maximal time lags.

关键词： project planning and control resource-constrained project scheduling activity-on-node networks maximal time lags make-to-order production overlapping operations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：