Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic

Ripon Kumar Chakrabortty · Alireza Abbasi · Michael J. Ryan

73 citations0/0 files storedInternational Transactions in Operational Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Resource-Constrained Project Scheduling Scheduling and Optimization Algorithms Scheduling and Timetabling Solutions

Abstract

Abstract This paper aims at providing a fast near‐optimum solution to the multi‐mode resource‐constrained project scheduling problems (MRCPSPs), for projects with activities that have known deterministic renewable and nonrenewable resource requirements. The MRCPSP is known to be nondeterministic polynomial‐time hard and has been solved using various exact, heuristic, and meta‐heuristic procedures. In this paper, a modified variable neighborhood search heuristic algorithm is used as an advanced optimization technique that suits scheduling problems. For the experimental study, we have considered a standard set of 3929 multi‐mode benchmark instances from the project scheduling library with a range of projects comprising 10–30 activities. Moreover, for a better comparison, this research also considers a standard set of 4320 newly developed multi‐mode instances from MMLIB50, MMLIB100, and MMLIB+ datasets. With the limit of 50,000 schedules on these datasets, our proposed algorithm provides better makespan for 106, 34, and 1601 instances, respectively, which justifies the efficiency of the proposed algorithm, particularly for projects with a larger number of activities. The results reported in this paper can be used as a benchmark for other researchers to compare and improve.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 73 citations exist upstream.

References

1997PSPLIB - A project scheduling problem library 2005Experimental investigation of heuristics for resource-constrained project scheduling: An update 1996Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation 1995Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems 1998Resource-constrained project scheduling: A survey of recent developments 2003A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version 1982Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case 2009A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem

Cited by

2020A reinforcement learning based multi-method approach for stochastic resource constrained project scheduling problems 2021A variable neighborhood search approach for the resource-constrained multi-project collaborative scheduling problem

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.