Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
type: Item
instance of: scholarly article
title: Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
zbMATH Open document ID: 0916.90151
DOI: 10.1016/0377-2217(95)00357-6
author: Rainer Kolisch
published in: European Journal of Operational Research
publication date: 1998-10-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1208481
zbMATH Keywords: parallel and serial scheduling
zbMATH Keywords: resource-constrained project scheduling
zbMATH Keywords: performance-ranking of priority rules
Wikidata QID: Q111605540
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00357-6
OpenAlex ID: W2067462952
cites work: Q5323389
cites work: Optimal Reduction of Two-Terminal Directed Acyclic Graphs
cites work: Q5202826
cites work: Solving resource-constrained project scheduling problems by a* search
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Some efficient multi-heuristic procedures for resource-constrained project scheduling
cites work: The Schedule-Sequencing Problem
cites work: Une méthode arborescente pour résoudre les problèmes cumulatifs
cites work: Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
cites work: Q4658190
cites work: Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation
cites work: Q4149194
cites work: An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints
cites work: On the use of the complexity index as a measure of complexity in activity networks
cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
cites work: Scheduling of Project Networks by Job Assignment
cites work: Q4166568
cites work: On the measurement of complexity in activity networks
cites work: Q3720323
cites work: Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
cites work: Multi-Project Scheduling: Categorization of Heuristic Rules Performance
cites work: Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
cites work: An iterative scheduling technique for resource-constrained project scheduling
cites work: A comparative study of computational procedures for the resource constrained project scheduling problem
cites work: Project scheduling: The effects of problem structure on heuristic performance
cites work: A Horizon-Varying, Zero-One Approach to Project Scheduling
cites work: Scheduling of project networks
cites work: A More Portable Fortran Random Number Generator
cites work: Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
cites work: An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
cites work: Heuristic Performance and Network/Resource Characteristics in Resource-constrained Project Scheduling
description: scientific article; zbMATH DE number 1208481