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

An adapted constraint-programming formulation of the resource-constrained project scheduling problem applied to the identical parallel machines group shop and mixed shop scheduling problems

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2025年第3期32卷 1422-1441页

作者： Yuraszeck, Francisco Mejia, Gonzalo Luer-Villagra, Armin Univ Andres Bello Dept Engn Sci Quillota 980 Vina Del Mar 2531015 Chile Univ La Sabana Campus Puente Comun Km 7 Autopista Norte Bogota Chia 250001 Colombia Univ Andres Bello Dept Engn Sci Autopista Concepc Talcahuano 7100 Vina Del Mar Chile

In this paper, we study the group shop and the mixed shop scheduling problems with single and identical parallel machines at each workstation with the makespan criterion. We adapted a constraint programming formulation previously presented for the classical resource-constrained project scheduling problem. The effectiveness of our approach is evident in the fact that it achieved optimality in 107 out of 130 classical group shop scheduling problem instances and in 320 classical mixed shop scheduling problem instances. In the last set, we obtained 13 new optimal solutions.

关键词： resource-constrained project scheduling group shop stage shop mixed shop parallel machines constraint programming job shop open shop

来源：评论

学校读者我要写书评

暂无评论

resource-constrained project scheduling problem with uncertain durations and renewable resources

引用

INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS 2016年第4期7卷 613-621页

作者： Ma, Weimin Che, Yangyang Huang, Hu Ke, Hua Tongji Univ Sch Econ & Management Shanghai 200092 Peoples R China

resource-constrained project scheduling problem is to make a schedule for minimization of the makespan subject to precedence and resource constraints. In this paper, we consider an uncertain resource-constrained project scheduling problem (URCPSP) in which the activity durations, with no historical data generally, are estimated by experts. In order to deal with these estimations, an uncertainty-theory-based project scheduling model is proposed. Furthermore, a genetic algorithm integrating a 99-method based uncertain simulation is designed to search the quasi-optimal schedule. Numerical examples are also provided to illustrate the effectiveness of the model and the algorithm.

关键词： resource-constrained project scheduling Uncertain duration Genetic algorithm Uncertainty theory Renewable resource

来源：评论

学校读者我要写书评

暂无评论

resource-constrained project scheduling:: A critical activity reordering heuristic

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2003年第2期149卷 282-301页

作者： Valls, V Quintanilla, S Ballestín, F Univ Valencia Fac Matemat Dpto Estadist & Invest Operat E-46100 Valencia Spain Univ Valencia Fac Econ & Empresariales Dpto Econ Financiera & Matemat Valencia Spain

In this paper, we present a new metaheuristic algorithm for the resource-constrained project-scheduling problem. The procedure is a non-standard implementation of fundamental concepts of tabu search without explicitly using memory structures embedded in a population-based framework. The procedure makes use of a fan search strategy to intensify the search, whereas a strategic oscillation mechanism loosely related to the forward/backward technique provides the necessary diversification. Our implementation employs the topological order (TO) representation of schedules. To explore the TO vector space we introduce three types of moves, two of them based on the concept of relative criticality, and a third one based on multi-pass sampling ideas. The strategic utilisation of probabilities for move construction is another distinguishing feature of our approach. Extensive computational testing with more than 2000 problem instances shows the merit of the proposed solution method. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： resource-constrained project scheduling tabu search heuristics

来源：评论

学校读者我要写书评

暂无评论

resource-constrained project scheduling:: A critical activity reordering heuristic

Resource-constrained project scheduling:: A critical activit...

引用

7th International Workshop on project Managment and scheduling

关键词： resource-constrained project scheduling tabu search heuristics

来源：评论

学校读者我要写书评

暂无评论

resource-constrained project scheduling: an international exercise in DSS development

引用

Decision Support Systems 1988年第2期4卷 249-257页

作者： Anthonisse, J.M. Van Hee, K.M. Lenstra, J.K. Centre for Mathematics and Computer Science (CWI) 1009 AB Amsterdam Netherlands Department of Mathematics and Computing Science Eindhoven University of Technology 5600 MB Eindhoven Netherlands Centre for Mathematics and Computer Science (CWI) 1009 AB Amsterdam Netherlands Econometric Institute Erasmus University 3000 DR Rotterdam Netherlands

The International Institute for Applied Systems Analysis in Laxenburg, Austria, coordinates an international exercise in the development of decision support systems. The participants will independently develop a number of interactive planning systems for resource-constrained project scheduling, in the hope of generating knowledge and experience in the design, analysis and implementation of decision support systems. This note specifies the rules of the exercise. © 1988.

关键词： Comparative Evaluation Decision Support System resource-constrained project scheduling

来源：评论

学校读者我要写书评

暂无评论

An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags

引用

JOURNAL OF scheduling 2011年第4期14卷 391-406页

作者： Ballestin, Francisco Barrios, Agustin Valls, Vicente Univ Publ Navarra Dept Estadist & Invest Operat Pamplona 31006 Spain Univ Norte Dept Matemat & Fis Barranquilla Colombia Univ Valencia Dept Estadist & Invest Operat Burjassot 46100 Spain

In this paper, we present an evolutionary algorithm (EVA) for solving the resource-constrained project scheduling problem with minimum and maximum time lags (RCPSP/max). EVA works on a population consisting of several distance-order-preserving activity lists representing feasible or infeasible schedules. The algorithm uses the conglomerate-based crossover operator, the objective of which is to exploit the knowledge of the problem to identify and combine those good parts of the solution that have really contributed to its quality. In a recent paper, Valls et al. (European J. Oper. Res. 165, 375-386, 2005) showed that incorporating a technique called double justification (DJ) in RCPSP heuristic algorithms can produce a substantial improvement in the results obtained. EVA also applies two double justification operators DJmax and DJU adapted to the specific characteristics of problem RCPSP/max to improve all solutions generated in the evolutionary process. Computational results in benchmark sets show the merit of the proposed solution method.

关键词： resource-constrained project scheduling Maximum time lags Meta-heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling

引用

COMPUTERS & OPERATIONS RESEARCH 2016年 71卷 71-81页

作者： He, Jieguang Chen, Xindu Chen, Xin Guangdong Univ Technol Key Lab Comp Integrated Mfg Syst Guangzhou Guangdong Peoples R China Guangdong Univ Petrochem Technol Dept Comp Sci & Technol Maoming Guangdong Peoples R China

This paper presents an effective heuristic algorithm based on the framework of the filter-and-fan (F&F) procedure for solving the resource-constrained project scheduling problem (RCPSP). The proposed solution methodology, called the filter-and-fan approach with adaptive neighborhood switching (FFANS), operates on four different neighborhood structures and incorporates improved local search, F&F search with multiple neighborhoods and an adaptive neighborhood switching procedure. The improved local search, in which a new insert-based move strategy and new time compression measurement of schedules having the same makespan are embedded, is utilized to identify a local optimum and a basic move list. The F&F search, aimed to further improve the local optimum, applies multi-neighborhood filter and fan strategies to generate compound moves and a neighborhood-switch list in a tree search fashion. When the current neighborhood cannot further improve the local optimum, the adaptive neighborhood switching procedure picks the most potential neighborhood for the next run of the local search procedure. The entire solution procedure is autonomous and adaptive due to its variable search range depending on the project sizes and characteristics. Computational results and comparisons with some state-of-the-art algorithms indicate the effectiveness and competence of the proposed FFANS. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： resource-constrained project scheduling Local search Filter-and-fan Multiple neighborhoods Adaptive neighborhood switching

来源：评论

学校读者我要写书评

暂无评论

A tool to test and validate algorithms for the resource-constrained project scheduling problem

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2018年 118卷 251-265页

作者： Vanhoucke, Mario Coelho, Jose Univ Ghent Tweekerkenstr 2 B-9000 Ghent Belgium Vlerick Business Sch Reep 1 B-9000 Ghent Belgium UCL Sch Management 1 Canada Sq London E14 5AA England INESC Technol & Sci Porto Portugal Univ Aberta Rua Escola Politecn 147 P-1269001 Lisbon Portugal

In a paper written by by Vanhoucke et al. (2016), an overview of artificial and empirical project databases has been given for integrated project management and control. These databases are collections of the most wellknown and widespread data instances available in literature for the construction of a baseline schedule, the analysis of schedule risk or the use for project control. The current paper serves as a follow-up study to further elaborate on the use of these data instances, and to give researchers an incentive to use these datasets for their research on the development and validation of new algorithms for project scheduling. Therefore, unlike the general focus of the previous paper on baseline scheduling, schedule risk analysis and project control, the focus on the current paper is restricted to resource-constrained project scheduling. The intention of this follow-up overview is fourfold. First and foremost, a procedure is proposed to facilitate the reporting of best known solutions for the well-known single- and multi-mode resource-constrained project scheduling problem to minimize the project makespan. Secondly, the paper reports our best known solutions we obtained so far, and reflects on the network and resource parameters that increase the project complexity. In doing so, areas to focus on for future research are detected, and an attempt to define hard problem instances is given. Thirdly, a new dataset is presented for the resource-constrained project scheduling problem that is much more diverse in both the network topology and resource scarceness and will enable the future researcher to develop algorithms to solve a wider range of project problems. Finally, the paper also adds some links to tutorials and other relevant information to stimulate researchers to download the data and update best known solutions once available.

关键词： project data resource-constrained project scheduling Best known solutions

来源：评论

学校读者我要写书评

暂无评论

An ant-based coordination mechanism for resource-constrained project scheduling with multiple agents and cash flow objectives

引用

FLEXIBLE SERVICES AND MANUFACTURING JOURNAL 2013年第1-2期25卷 94-121页

作者： Fink, Andreas Homberger, Joerg Univ Hamburg D-22043 Hamburg Germany Stuttgart Univ Appl Sci D-70174 Stuttgart Germany

We consider a multi-agent extension of the non-preemptive single-mode resource-constrained project scheduling problem with discounted cash flow objectives. Such a problem setting is related to project scheduling problems which involve different autonomous firms where project activities are uniquely assigned to the project parties (agents). Taking into account opportunistic agents and the resulting information asymmetry we propose a general decentralized negotiation approach which uses ideas from ant colony optimization. In the course of the negotiation the agents iteratively vote on proposed project schedules without disclosing preference information regarding cash flow values. Computational experiments serve to analyze the agent-based coordination mechanism in comparison to other approaches from the literature. The proposed mechanism turns out as an effective method for coordinating self-interested agents with conflicting goals which collaborate in resource-constrained projects.

关键词： resource-constrained project scheduling Decentralized coordination Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

A heuristic search algorithm for solving resource-constrained project scheduling problems

引用

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 2003年第2期20卷 143-160页

作者： Ahsan, MK Tsao, DB Tokyo Inst Technol Dept Ind Engn & Management Tokyo 152 Japan

This paper presents an artificial intelligence based heuristic search algorithm for resource-constrained project scheduling problems. The search process starts from an empty schedule and ends in a complete schedule. The procedure follows a stepwise generation of partial schedules that are connected by a lower bound on completion of unscheduled activities. A higher value of lower bound in a new partial schedule needs to update the search path with backtracking. We propose a composite multi-criteria search technique (CMST) to determine new partial schedules at each step. CMST combines three criteria instead of the single selection criterion of the previously developed search and learn A* (SLA*) algorithm. Our objective is to comparatively reduce the number of backtrackings and adapt the algorithm for approximate solutions of large problems. The performance of CMST is analyzed for different problems and different weights of the three criteria. Results show that the proposed CMST reduces backtracking as well as computational time to a large extent compared to SLA* with optimal or very close to optimal solution.

关键词： resource-constrained project scheduling search algorithms heuristics computational intelligence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：