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

A Two-Layer Approach for the decentralized multi-project scheduling Problem Sharing multi-Skilled Staff

IEEE ACCESS 2024年 12卷 29204-29221页

作者： You, Weibao Xu, Zhe Zhao, Song Beihang Univ Sch Econ & Management Beijing 100191 Peoples R China

With the rapid development of economic globalization and information technology, the projects undertaken by enterprises are gradually becoming larger and more complex. The multi-project management model has become the norm in enterprise management, and it shows a trend of decentralization in terms of geographical distribution and management environment. This decentralization mainly manifests in the fact that each project has its own private information and benefit objectives and shares limited global resources with other projects during the execution process, forming a decentralized decision-making environment. As an extension of the resource-constrained project scheduling problem, the decentralized resource-constrained multi-project scheduling problem integrates single-project scheduling and global resource coordination allocation in a decentralized decision-making environment with multiple independent decision-makers. Furthermore, when considering global resources as multi-skilled staff, the decentralized multi-project scheduling problem sharing multi-skilled staff studied in this paper is proposed. A two-layer model containing local scheduling and global coordination decision-making is established to describe this problem. A two-layer approach (TLA) is proposed to solve this problem. In the local scheduling layer, a bat algorithm based on forward-backward scheduling (BAFBS) is developed to generate local baseline schedules to minimize the single-project completion time. In the global coordination decision-making layer, a variable neighborhood tabu search algorithm with greedy assignment strategy is designed to resolve global resource conflicts to minimize the multi-project total tardiness cost. Computational experiments are conducted based on the multi-project scheduling Problem LIBrary dataset. The results show that the BAFBS can obtain high-quality local baseline schedules. Compared to the existing decentralized and centralized methods, our proposed TLA can get

关键词： scheduling Resource management Decision making Uncertainty Optimization methods decentralized applications Complex systems project management Globalization Enterprise resource planning Market research Market opportunities Personnel decentralized multi-project scheduling multi-skilled staff two-layer approach tabu search bat algorithm

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT GENETIC ALGORITHM FOR decentralized multi-project scheduling WITH RESOURCE TRANSFERS

引用

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 2022年第1期18卷 1-24页

作者： Zhang, Jingwen Liu, Wanjun Liu, Wanlin Northwestern Polytech Univ Sch Management Xian 710072 Shaanxi Peoples R China

This paper investigates the decentralized resource-constrained multi-project scheduling problem with transfer times (DRCMPSPTT) in which the transfer times of the global resources among different projects are assumed to be sequence-independent, while transfers of local resources take no time within a project. First, two decision variables (y(ijg) and w(ijg)) are adopted to express the transition state of global resources between projects. y(ijg) (takes a value of 0 or 1) represents whether activity i transfers global resource g to activity j;accordingly, the transferred quantity is denoted as w(ijg). Then, we construct an integer linear model with the goal of minimizing the average project delay for the DRCMPSPTT. Second, an adaptive genetic algorithm (GA) is developed to solve the DRCMPSPTT. To gain the schedules for the DRCMPSPTT, the traditional serial and parallel scheduling generation schemes (SGSs) are modified to combine with different resource transfer rules and to design multiple decoding schemes. Third, the numerical experiments are implemented to analyse the effects of eight decoding schemes, and we found that the scheme comprising the parallel SGS and maxRS rule can make the GA work the best;furthermore, the effectiveness of the GA_maxRS (GA embedded with the best scheme) is demonstrated by solving some instances with different sizes.

关键词： decentralized multi-project scheduling resource transfer times genetic algorithm scheduling generation schemes resource transfer rules

来源：评论

学校读者我要写书评

暂无评论

New closed-loop approximate dynamic programming for solving stochastic decentralized multi-project scheduling problem with resource transfers

引用

EXPERT SYSTEMS WITH APPLICATIONS 2021年 185卷 115593-115593页

作者： Zhao, Song Xu, Zhe Beihang Univ Sch Econ & Management Beijing 100191 Peoples R China

Resource transfers and uncertain activity durations are two practical factors that are difficult to cope with in real project management. This paper studies a new decentralized multi-project scheduling problem with both resource transfers and uncertain activity durations, we name it the stochastic decentralized multi-project scheduling problem with resource transfers (SDRCMPSPTT). To tackle the curse-of-dimensionality of an exact solution approach, we develop a new and effective rollout policy-based approximate dynamic programming (ADP) algorithm for SDRCMPSPTT. Based on the benchmark instances, we build a new data set and examine the performance of 12 priority rule heuristics, then select the two best ones as the base policy for our rollout algorithm. The proposed approach is verified under a stochastic environment by assessing different base heuristic policies, computational results show that the rollout algorithm can further improve the solution quality of the base heuristics. Compared with the state-of-the-art algorithm for solving the decentralized multi project scheduling problem under a deterministic environment, our rollout policy-based ADP algorithm can also obtain competitive solutions.

关键词： decentralized multi-project scheduling Resource transfers Uncertain activity durations Approximate dynamic programming Rollout algorithm

来源：评论

学校读者我要写书评

暂无评论

A multi-agent system for decentralized multi-project scheduling with resource transfers

引用

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2013年第2期146卷 646-661页

作者： Adhau, Sunil Mittal, M. L. Mittal, Abhinav Malaviya Natl Inst Technol Dept Mech Engn Jaipur 302017 Rajasthan India

The companies dealing with multiple projects are geographically distributed at different locations. These projects require local (always available to the concerned project) and global (shared among the projects) resources that are available in limited quantity. The global resources are generally required to be transferred physically among the projects, consuming significant amounts of both time and cost. The existing multi-agent systems for decentralized resource constrained multi-project scheduling problem (DRCMPSP) do not consider the resource transfer time and related cost for execution and control. We introduce DRCMPSP-RT that explicitly considers the transfer of shared global resources. This paper proposes a novel distributed multi-agent system using auctions based negotiation (DMAS/RIA) approach for the resource intervals and allocating multiple different types of shared resources amongst multiple competing projects. To incorporate this feature the resources are planned to transfer in advance for the eligible successor activities to schedule within the current time. The proposed approach can solve complex large-sized multi-project instances without any limiting assumptions regarding the number of activities, shared resources or the number of projects. The DMAS/RIA is tested on standard set of 140 problem instances. Computational experiments compare the presented managerial approach with two transfer time neglecting approaches. The result found the relative GAP with an average of 33.43% with respect to average project delay (APD). Whereas, the percentage gap of total makespan (TMS) is obtained with an average of 16.52%. The result proves the impact of resource transfer time on project delay and increase in multi-project duration that can be minimized by project managers considering it in planning phase. (C) 2013 Elsevier B.V. All rights reserved.

关键词： decentralized multi-project scheduling multi-agent system Resource transfer time Combinatorial bidding and auction Distributed negotiations Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A (μ, λ)-coordination mechanism for agent-based multi-project scheduling

引用

OR SPECTRUM 2012年第1期34卷 107-132页

作者： Homberger, Joerg Stuttgart Univ Appl Sci D-70174 Stuttgart Germany

A new generic negotiation-based mechanism to coordinate project planning software agents to share resources among projects is described. The mechanism, which takes into account asymmetric information and opportunistic behavior, is concretized for the decentralized resource constrained multi-project scheduling problem, and evaluated on 80 benchmark instances taken from the literature and 60 newly generated instances. Computational tests show that the proposed mechanism comes close to results obtained by central solution methods. For twelve benchmark instances new best solutions could be computed.

关键词： decentralized multi-project scheduling multi-agent system Negotiation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：