Multi-Mode Project Scheduling with Limited Resource and Budget Constraints

• Published in: 2018 International Conference on Innovation in Engineering and Technology (ICIET) pp. 1 - 6
• Main Authors: Sultana, Babe, Katha, Jannatul Ferdous, Sarker, Sujan, Razzaque, Md. Abdur
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2018
• Subjects: Branch-and-bound; CPLEX; Encoding; Job shop scheduling; Mathematical model; Mixed integer linear programming; Optimal scheduling; Processor scheduling; Task analysis
• DOI: 10.1109/CIET.2018.8660864

In this research paper, we figure out multi-mode project scheduling problem where resources are limited and project scheduling cost is fixed. An activity of the project may be executed by a resource in a chosen mode. These multi-modes are relying on project duration time, time lags to other activities and requirement of resources. A multi-mode resource constrained project scheduling problem can be formally prescribed by a number of activities-nodes with several modes that should be scheduled to minimize the project duration, subject to generalized precedence relations with limited resources. The most common exact approaches for solving these problems are based on branch-and-bound algorithm, linear programming and boolean satisfiability (SAT). We consider, Mixed Integer Linear Programming (MILP) for modeling and solving the project scheduling problem with limited resources, budget constraints and activity precedence relations. In this paper, we propose a mathematical model for finding its optimal solution. We jointly consider to make sure that, the project duration is minimized, while maintaining the budget limit and incorporate multiple types of computational resources. The performance evaluation results carried out in CPLEX optimization tool, show that the proposed model outperforms existing approaches in terms of project completion time and project cost.