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

scheduling non-professional table-tennis leagues

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2010年第2期200卷 358-367页

作者： Knust, Sigrid Univ Osnabruck Inst Comp Sci D-49069 Osnabruck Germany

In this paper we consider a sports league scheduling problem which occurs in planning non-professional table-tennis leagues. The problem consists in finding a schedule for a time-relaxed double round robin tournament where different hard and soft constraints have to be taken into account. We model the problem as an integer linear program and a multi-mode resource-constrained project scheduling problem, respectively. Based on the second model a heuristic solution algorithm is proposed, which proceeds in two stages using local search and genetic algorithms. Computational results show the efficiency of the approaches. (C) 2009 Elsevier B.V. All rights reserved.

关键词： scheduling Sports league resource-constrained project scheduling problem Partially renewable resources Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A linear programming and constraint propagation-based lower bound for the RCPSP

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2000年第2期127卷 355-362页

作者： Brucker, P Knust, S Univ Osnabruck Fachbereich Math Informat D-49069 Osnabruck Germany

A new destructive lower bound for the resource-constrained project scheduling problem (RCPSP) is presented. Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacity of each resource type is limited. Furthermore, finish-start precedence relations between the activities are given. The objective is to determine a schedule with minimal makespan. The lower bound calculations are based on two methods for proving infeasibility of a given threshold value T for the makespan. The first uses constraint propagation techniques, while the second is based on a linear programming formulation. A column generation procedure is presented for the linear programming formulation and computational results are reported for an algorithm combining both concepts. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： scheduling resource-constrained project scheduling problem lower bounds column generation constraint propagation

来源：评论

学校读者我要写书评

暂无评论

Bi-objective Optimization of RCPSP under Time-of-use Electricity Tariffs

引用

KSCE JOURNAL OF CIVIL ENGINEERING 2022年第12期26卷 4971-4983页

作者： He, Lihua Zhang, Yajun China Univ Petr East China Sch Econ & Management Qingdao 266580 Shandong Peoples R China

In recent years, to alleviate the peak load of the power grid, many countries have implemented time-of-use (TOU) electricity tariffs. When both manpower and equipment are needed to perform project activities, wage and electricity costs become the main components of the total project cost. High-power activities can be implemented during off-peak periods to reduce energy costs and peak demand for electricity. Labor shift differential payments will increase wage costs for off-peak labor overtime. This paper proposes a bi-objective mixed-integer nonlinear programming model for resource-constrained project scheduling problems under TOU. Machine-level decisions are made to minimize total project cost and completion time. This model has an enormous solution space when there are many tasks and long durations, especially when the time granularity is small, which is not conducive to an accurate solution. Therefore, an improved NSGA-II algorithm is presented to effectively solve the model. The results show that the proposed model and algorithm can effectively reduce the total project cost and construction period while reducing peak power demand.

关键词： resource-constrained project scheduling problem Time-of-use electricity tariffs Bi-objective optimization NSGA-II algorithm Labor shift differential payments

来源：评论

学校读者我要写书评

暂无评论

Best-order crossover for permutation-based evolutionary algorithms

引用

APPLIED INTELLIGENCE 2015年第4期42卷 751-776页

作者： Andreica, Anca Chira, Camelia Univ Babes Bolyai Dept Comp Sci R-3400 Cluj Napoca Romania Tech Univ Cluj Napoca Dept Comp Sci Cluj Napoca Romania

Permutation-based encoding is used by many evolutionary algorithms dealing with combinatorial optimization problems. An important aspect of the evolutionary search process refers to the recombination process of existing individuals in order to generate new potentially better fit offspring leading to more promising areas of the search space. In this paper, we describe and analyze the best-order recombination operator for permutation-based encoding. The proposed operator uses genetic information from the two parents and from the best individual obtained up to the current generation. These sources of information are integrated to determine the best order of values in the new permutation. In order to evaluate the performance of best-order crossover, we address three well-known -hard optimization problems i.e. Travelling Salesman problem, Vehicle Routing problem and resource-constrained project scheduling problem. For each of these problems, a set of benchmark instances is considered in a comparative analysis of the proposed operator with eight other crossover schemes designed for permutation representation. All crossover operators are integrated in the same standard evolutionary framework and using the same parameter setting to allow a comparison focused on the recombination process. Numerical results emphasize a good performance of the proposed crossover scheme which is able to lead to overall better quality solutions.

关键词： Evolutionary algorithms Crossover Travelling salesman problem Vehicle routing problem resource-constrained project scheduling problem

来源：评论

学校读者我要写书评

暂无评论

Heuristic algorithm for RCPSP with the objective of minimizing activities' cost

引用

Journal of Systems Engineering and Electronics 2006年第1期17卷 96-102页

作者： Liu Zhenyuan Wang Hongwei Inst. of Systems Engineering Huazhong Univ. of Science and Technology Wuhan 430074 P. R. China

resource-constrained project scheduling problem（RCPSP） is an important problem in research on project management. But there has been little attention paid to the objective of minimizing activities＇ cost with the resource constraints that is a critical sub-problem in partner selection of construction supply chain management because the capacities of the renewable resources supplied by the partners will effect on the project scheduling. Its mathematic model is presented firstly, and analysis on the characteristic of the problem shows that the objective function is non-regular and the problem is NP-complete following which the basic idea for solution is clarified. Based on a definition of preposing activity cost matrix, a heuristic algorithm is brought forward. Analyses on the complexity of the heuristics and the result of numerical studies show that the heuristic algorithm is feasible and relatively effective.

关键词： systems engineering resource-constrained project scheduling problem activities' cost preposing activity cost matrix heuristic algorithm.

来源：评论

学校读者我要写书评

暂无评论

Explaining the cumulative propagator

引用

CONSTRAINTS 2011年第3期16卷 250-282页

作者： Schutt, Andreas Feydy, Thibaut Stuckey, Peter J. Wallace, Mark G. Univ Melbourne Natl ICT Australia Dept Comp Sci & Software Engn Melbourne Vic 3010 Australia Monash Univ Sch Comp Sci & Software Engn Clayton Vic 3800 Australia

The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal of research has investigated new stronger and faster filtering techniques for cumulative, but still most of these techniques only pay off in limited cases or are not scalable. Recently, the "lazy clause generation" hybrid solving approach has been devised which allows a finite domain propagation engine possible to take advantage of advanced SAT technology, by "lazily" creating a SAT model of an FD problem as computation progresses. This allows the solver to make use of SAT explanation and autonomous search capabilities. In this article we show how, once we use lazy clause generation, modelling the cumulative constraint by decomposition creates a highly competitive version of cumulative. Using decomposition into component parts automatically makes the propagator incremental and able to explain itself. We then show how, using the insights from the behaviour of the decomposition, we can create global cumulative constraints that explain their propagation. We compare these approaches to explaining the cumulative constraint on resource constrained project scheduling problems. All our methods are able to close a substantial number of open problems from the well-established PSPlib benchmark library of resource-constrained project scheduling problems.

关键词： Cumulative constraint Explanations Nogood learning Lazy clause generation resource-constrained project scheduling problem

来源：评论

学校读者我要写书评

暂无评论

Quality- and profit-oriented scheduling of resource-constrained projects with flexible project structure via a genetic algorithm

引用

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING 2016年第5期10卷 574-595页

作者： Kellenbrink, Carolin Helber, Stefan Leibniz Univ Hannover Dept Prod Management Hannover Germany

We study the problem of determining both the structure and the schedule of projects subject to capacity constraints. We assume that those projects are flexible in the sense that the activities to be implemented are not entirely known in advance. In such a setting, decisions must be made with respect to the implementation of the optional activities. Such decisions affect the duration, cost, quality and eventual revenue of the project. Examples of this type of problem can often be found when complex capital goods such as aircraft engines are overhauled, or when buildings are renovated to meet higher environmental and efficiency standards. We describe the problem, develop a mixed-integer optimisation model, explain specific features of a genetic algorithm to solve the problem and report the results of a numerical study.

关键词： quality resource-constrained project scheduling problem RCPSP genetic algorithm project scheduling flexible project structure

来源：评论

学校读者我要写书评

暂无评论

Dynamic Cooperative Interaction Strategy for Solving RCPSP by a Team of Agents 8th

Dynamic Cooperative Interaction Strategy for Solving RCPSP b...

引用

8th International Conference on Computational Collective Intelligence (ICCCI)

作者： Jedrzejowicz, Piotr Ratajczak-Ropel, Ewa Gdynia Maritime Univ Dept Informat Syst Morska 83 PL-81225 Gdynia Poland

ISBN: (纸本)9783319452425;9783319452432

In this paper a dynamic cooperative interaction strategy for the A-Team solving the resource-constrained project scheduling problem (RCPSP) is proposed and experimentally validated. The RCPSP belongs to the class of NP-hard optimization problems. To solve this problem a team of asynchronous agents (A-Team) has been implemented using multiagent environment. An A-Team consist of the set of objects including multiple optimization agents, manager agents and the common memory which through interactions produce solutions of hard optimization problems. In this paper the dynamic cooperative interaction strategy is proposed. The strategy supervises cooperation between agents and the common memory. To validate the proposed approach the preliminary computational experiment has been carried out.

关键词： resource-constrained project scheduling problem RCPSP Optimization Agent A-Team

来源：评论

学校读者我要写书评

暂无评论

An Extension of a Dynamic Heuristic Solution for Solving a Multi-Objective Optimization problem in the Defense Industry 3rd

An Extension of a Dynamic Heuristic Solution for Solving a M...

引用

3rd International Conference on Optimization, Learning Algorithms and Applications (OL2A)

作者： Ninpan, Khwansiri Kondratenko, Kirill Huang, Shuzhang Plancon, Alexandra Aumont, Arthur Artaud, Lucas Baker, Mouna Roumili, Emir Vitillo, Francesco Bechet, Lies Benmiloud Plana, Robert Assystem Digital Excellence Ctr Courbevoie France Assystem Technol & Innovat Courbevoie France

ISBN: (纸本)9783031530241;9783031530258

project scheduling in a real-life scenario often involves multiple-criteria decision-making in which no single solution exists. To solve such a problem, a multi-objective optimization method has been applied to define the satisfying trade-off between different criteria. In this paper, we focus on a specific use case in the defense industry in which the overall mission is to generate a maintenance plan for the transfer operations of power grid consumers to the new service area. The project objectives include restricting the outage duration during transfer operations, grouping operations concerning the proximity between them, moderating the allocation of supporting resource, and regulating human resources intervention outside business hours. To solve this problem, we propose a combination of heuristic approaches starting by defining a sequence of activities based on their complexities to be scheduled. Concerning the obtained order, a serial-schedule generation scheme (S-SGS) is then implemented by iterating through each activity to define the best time period to proceed the operation in accordance with project's multiple objectives. Finally, the output is transferred to our existing parallel scheme-based solver, Optimizio, to finally justify the project planning. The proposed S-SGS solution provides a feasible schedule of 110 transfer operations in 2 s with solution evaluation analysis and information of a Pareto frontier in approximately 15min. The set of Pareto optimal solutions allows the expert to explore potential trade-offs between criteria. Together with a fast execution time of the algorithms that benefits a multi-scenario simulation, our tool demonstrates a potential capacity to get the optimum outcome of the multi-objective optimization project.

关键词： Serial-Schedule Generation Scheme Multi-Objective Programming Heuristic Algorithms resource-constrained project scheduling problem

来源：评论

学校读者我要写书评

暂无评论

A holistic analysis of maritime logistics process in fuzzy environment in terms of business process management

引用

BUSINESS PROCESS MANAGEMENT JOURNAL 2023年第4期29卷 1116-1158页

作者： Akan, Ercan Iskenderun Tech Univ Dept Maritime Transportat Management Engn Iskenderun Turkiye

PurposeThe aim of this study is to provide a holistic analysis of all possible maritime business logistics processes related to import and export shipments in a fuzzy environment through a case study of a maritime logistics company based on the as-is and to-be models within business process management (BPM).Design/methodology/approachThe analyses considered the following perspectives: (i) in the stage of the process identification, the definition of the problem was carried out;(ii) in the stage of the process discovery, ocean department was divided into ocean export/import operation departments;ocean export/import operation were divided into freight collect/prepaid operation processes;ocean export/import logistics activity groups were broken down into sub-activities for freight collect/prepaid operation;the logistics activity groups and their sub-activities were defined;each sub-activity as either operation or documentation process group was classified;the durations of sub-activities were evaluated by decision-makers (DMs) as fuzzy sets (FSs);the monthly total jobs activities were estimated by DMs as FSs;the applied to monthly jobs activities of total shipments were estimated by DMs as FSs;the durations of each sub-activities were aggregated;the duration of the logistics activity groups and the sub-activities for per job were calculated;the cumulative workload of logistics activity groups and sub-activities were calculated;the duration of sub-activities for per job as operation or documentation departments were calculated, (iii) in the stage of the process analysis, cumulative ocean export/import workload as operation or documentation for freight collect/prepaid were calculated;duration of activity groups and sub-activities for per job as operation or documentation were calculated;cumulative workload activity groups and sub-activities as operation or documentation were calculated, (iv) in the stage of the process redesign, cumulative workload, process cycle time as

关键词： Maritime logistics Business process analysis Business process management Process redesign Fuzzy sets Critical path method resource-constrained project scheduling problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：