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

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

来源：评论

学校读者我要写书评

暂无评论

resource-constrained project scheduling Problem using Firefly Algorithm

引用

Procedia Computer Science 2018年 135卷 534-543页

作者： Tiffany Kassandra Rojali Derwin Suhartono Mathematics Department School of Computer Science Bina Nusantara University Jakarta 11480 Indonesia Computer Science Department School of Computer Science Bina Nusantara University Jakarta 11480 Indonesia

This research discusses house construction project scheduling which is classified as resource-constrained project scheduling problem with fuzzy trapezoidal number expressing optimistic and pessimistic view of activity duration. Parallel schedule generation scheme is used to generate feasible scheduling solutions, while firefly algorithm is used to find optimal solution by updating priority value of each activity. A web-based application is developed to run the scheduling simulation. scheduling simulation is conducted to determine the optimal parameter values for firefly algorithm and minimum project makespan. The optimal firefly algorithm parameter values are 10 for light absorption coefficient value, 10 for firefly population, 100 for maximal iteration, and 0.8 for random parameter. With 6 structure resources and 12 finishing resources available for construction project, the minimum project makespan value is [110, 142, 167, 224] with fuzzy magnitude value of 213.583.

关键词： resource-constrained project scheduling scheduling firefly algorithm parallel scheduling generation scheme fuzzy trapezoidal

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An exact composite lower bound strategy for the resource-constrained project scheduling problem

引用

COMPUTERS & OPERATIONS RESEARCH 2018年 93卷 135-150页

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

This paper reports on results for the well-known resource-constrained project scheduling problem. A branch-and-bound procedure is developed that takes into account all best performing components from literature, varying branching schemes and search strategies, using the best performing dominance rules and assembling these components into a unified search algorithm. A composite lower bound strategy that statically and dynamically selects the best performing bounds from literature is used to find optimal solutions within reasonable times. An extensive computational experiment is set up to determine the best combination of the various components used in the procedure, in order to benchmark the current existing knowledge on four different datasets from the literature. By varying the network topology, resource scarceness and the size of the projects, the computational experiments are carried out on a diverse set of projects. The procedure was able to find some new lower bounds and optimal solutions for the PSPLIB instances. Moreover, new best known results are reported for other, more diverse datasets that can be used in future research studies. The experiments revealed that even project instances with 30 activities cannot be solved to optimality when the topological structure is varied. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： resource-constrained project scheduling Branch-and-bound Lower bounds

来源：评论

学校读者我要写书评

暂无评论

On the strength of time-indexed formulations for the resource-constrained project scheduling problem

引用

OPERATIONS RESEARCH LETTERS 2017年第2期45卷 154-159页

作者： Artigues, Christian Univ Toulouse CNRS LAAS Toulouse France

For non-preemptive scheduling, time-indexed zero-one linear programming formulations have been deeply analyzed. This note clarifies the current knowledge about the strength of these formulations and shows that some formulations that have been proposed "new" in the literature are in fact weaker or equivalent to those already known. Much of the arguments used follow from a Ph.D. thesis by Sousa, which has been largely overlooked in the literature. (C) 2017 Elsevier B.V. All rights reserved.

关键词： resource-constrained project scheduling The linear programming Time-indexed variables On/off variables Relaxation strength Non-singular transformations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：