Insertion Algorithms with Justification for Solving the Resource-Constrained Project Scheduling Problem

DOI10.7494/dmms.2016.10.1-2.31zbMath1474.90153OpenAlexW2771791850MaRDI QIDQ5162162

P. Lebkowski, M. Klimek

Publication date: 2 November 2021

Published in: Decision Making in Manufacturing and Services (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/dmms.2016.10.1-2.31

zbMATH Keywords

insertion algorithmsjustificationpriority rulesresource-constrained project scheduling problemmakespan minimisationforward scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Uses Software

• PSPLIB

Cites Work

• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Scheduling subject to resource constraints: Classification and complexity
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
• PSPLIB -- a project scheduling problem library
• Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Perspectives in modern project scheduling.
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem

This page was built for publication: Insertion Algorithms with Justification for Solving the Resource-Constrained Project Scheduling Problem