Uncertain chance-constrained programming model for project scheduling problem

2017 ◽  
Vol 69 (3) ◽  
pp. 384-391 ◽  
Author(s):  
Xiao Wang ◽  
Yufu Ning
Keyword(s):  
Project Scheduling ◽  
Programming Model ◽  
Chance Constrained Programming ◽  
Scheduling Problem ◽  
Project Scheduling Problem ◽  
Constrained Programming

A Resource-Constrained Project Scheduling Problem with Fuzzy Activity Times

2016 ◽  
Vol 5 (4) ◽  
pp. 1-15 ◽  
Author(s):  
Hossein Zoulfaghari ◽  
Javad Nematian ◽  
Amir Abbas Kanani Nezhad
Keyword(s):  
Project Scheduling ◽  
Solution Method ◽  
Fuzzy Numbers ◽  
Programming Model ◽  
Benchmark Problems ◽  
Scheduling Problem ◽  
Resource Constrained ◽  
Resource Constrained Project Scheduling ◽  
Project Scheduling Problem ◽  
Activity Times

This paper is about the Resource-Constrained Project Scheduling Problem) RCPSP) which is one of the most important problems in last three decades and many researchers have paid attention to it and have reached useful results. In this paper, to cope with uncertainty issue, the RCPSP is studied under fuzzy environment where activity times are assumed to be fuzzy numbers. For this problem with fuzzy numbers as activity times, a linear mathematical programming model is presented. The objective function of the model is minimizing the completion time of project. Since the activity times are fuzzy numbers, finish time is also a fuzzy number. Hence, the model is transformed to a crisp multi-objective linear programming model. To illustrate the solution method, a numerical example is solved under both fuzzy and crisp environment and the results are compared. To prove the efficiency of the proposed method the results of the proposed solution method, some benchmark problems obtained from PSPLIB are utilized.

A Resource Constrained Project Scheduling Problem With Multi-Modes

2020 ◽  
Vol 11 (1) ◽  
pp. 55-70 ◽  
Author(s):  
Cansu Altintas ◽  
Meral Azizoglu
Keyword(s):  
Project Scheduling ◽  
Mixed Integer Linear Programming ◽  
Programming Model ◽  
Renewable Resource ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Resource Requirement ◽  
Project Completion ◽  
Variable Elimination ◽  
Project Scheduling Problem

In this study, the authors consider a project scheduling problem with a single non-renewable resource. The authors assume that the resource is released at scheduled times and specified quantities and the resource is consumed at activity completion. The activities can be processed at different modes where a mode is defined by a processing time and a resource requirement amount. The problem is to select the modes and timings of the activities so as to minimize the project completion time. The authors give a mixed integer linear programming model and discuss some variable elimination mechanisms to enhance its efficiency.

scholarly journals A MATHEMATICAL MODEL FOR DYNAMIC PROJECT SCHEDULING PROBLEM AND REACTIVE SCHEDULING IMPLEMENTATION

2020 ◽  
Vol 8 (4) ◽  
pp. 83-97
Author(s):  
Murat RUHLUSARAÇ ◽  
Filiz ÇALIŞKAN
Keyword(s):  
Project Scheduling ◽  
Resource Constraints ◽  
Programming Model ◽  
Real Life ◽  
Dynamic Environment ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Baseline Schedule ◽  
Dynamic Events ◽  
Project Scheduling Problem

In today's real-life implementations, projects are executed under uncertainty in a dynamic environment. In addition to resource constraints, the baseline schedule is affected due to the unpredictability of the dynamic environment. Uncertainty-based dynamic events experienced during project execution may change the baseline schedule partially or substantially and require projects' rescheduling. In this study, a mixed-integer linear programming model is proposed for the dynamic resource-constrained project scheduling problem. Three dynamic situation scenarios are solved with the proposed model, including machine breakdown, worker sickness, and electricity power cut. Finally, generated reactive schedules are completed later than the baseline schedule.

scholarly journals Model and Algorithm for Human Resource-Constrained R&D Program Scheduling Optimization

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Junjie Chen ◽  
Shurong Tong ◽  
Hongmei Xie ◽  
Yafei Nie ◽  
Jingwen Zhang
Keyword(s):  
Project Scheduling ◽  
Optimization Problems ◽  
Programming Model ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Resource Constrained ◽  
Enumeration Algorithm ◽  
Resource Constrained Project Scheduling ◽  
Project Scheduling Problem

In resource-constrained project scheduling problems, renewable resources can be expanded into human resources with competency differences. A flexible resource-constrained project scheduling problem with competency differences is proposed, which is a practical extension close to Research and Development (R&D) program management, from the traditional multimode resource-constrained project scheduling problem. A parameter and estimation formula to measure staff competency is presented, and a mixed-integer programming model is established for the problem. The single-objective optimization problems of optimal duration and optimal cost are solved sequentially according to the biobjective importance. To solve the model, according to the assumptions and constraints of the model, the initial network diagram of multiple projects is determined, the enumeration algorithm satisfying constraint conditions provides the feasible solution sets, and the algorithm based on dynamic programming is designed for phased optimization. Experimental results show that the proposed optimization model considering competence differences can solve the problem effectively.

Sign in / Sign up

Export Citation Format

Share Document