![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
ABSTRACT
Most resource-constrained project scheduling problems consider resources that are independent of the job processing sequence. However, solving project scheduling problems in some industrial manufacturing is challenging because the required resources depend on the job processing sequence in existing scheduling approaches. To address this issue, this paper proposes a dependent resource-constrained project scheduling problem formulated with two types of models: a conceptual model and a binary integer programming model. The performance of four proposed algorithms – binary integer programming, reduced subproblem of the binary integer programming, job sequence assignment, and job as early as possible – is tested on 68 combinations of numerical simulation experiments. The computational results show that the job as early as possible algorithm can find a better approximate solution for solving real-world problems. This achievement aids project managers in generating activity schedules and finding the approximate minimum makespan for a project with dependent resource constraints.
Graphical abstract
Abbreviations
| Abbreviation | = | Definition |
| BIP | = | Binary integer programming |
| DRCPSP | = | Dependent resource-constrained project scheduling problem |
| JAEAP | = | Job as early as possible assignment rule |
| JPS | = | Job processing sequence |
| JSA | = | Job sequence assignment rule |
| RCPSP | = | Resource-constrained project scheduling problem |
| rsBIP | = | Reduced subproblem of binary integer programming |
Disclosure statement
No potential conflict of interest was reported by the author(s).